Compiling Graph Transformation Rules into a Procedural Language for Behavioral Modeling

2014 ◽  
Keyword(s):  
Graph Transformation ◽  
Behavioral Modeling ◽  
Transformation Rules

A NOVEL APPROACH TO VERIFY GRAPH SCHEMA-BASED SOFTWARE SYSTEMS

2009 ◽  
Vol 19 (06) ◽  
pp. 857-870 ◽  
Author(s):  
VAHID RAFE ◽  
ADEL T. RAHMANI
Keyword(s):  
Graph Transformation ◽  
Behavioral Modeling ◽  
Model Transformations ◽  
Software Systems ◽  
Hierarchical Systems ◽  
Input Language ◽  
Novel Approach ◽  
Graph Schema ◽  
Transformation Systems ◽  
Graph Transformation Systems

Graph Grammars have recently become more and more popular as a general formal modeling language. Behavioral modeling of dynamic systems and model to model transformations are a few well-known examples in which graphs have proven their usefulness in software engineering. A special type of graph transformation systems is layered graphs. Layered graphs are a suitable formalism for modeling hierarchical systems. However, most of the research so far concentrated on graph transformation systems as a modeling means, without considering the need for suitable analysis tools. In this paper we concentrate on how to analyze these models. We will describe our approach to show how one can verify the designed graph transformation systems. To verify graph transformation systems we use a novel approach: using Bogor model checker to verify graph transformation systems. The AGG-like graph transformation systems are translated to BIR — the input language of Bogor — and Bogor verifies that model against some properties defined by combining LTL and special purpose graph rules. Supporting schema-based and layered graphs characterize our approach among existing solutions for verification of graph transformation systems.

scholarly journals A UML/OCL framework for the analysis of graph transformation rules

2009 ◽  
Vol 9 (3) ◽  
pp. 335-357 ◽  
Author(s):  
Jordi Cabot ◽  
Robert Clarisó ◽  
Esther Guerra ◽  
Juan de Lara
Keyword(s):  
Graph Transformation ◽  
Transformation Rules

A Graph Grammar Approach to Generate Neural Network Topologies

2007 ◽  
Author(s):  
Chaitanya Vempati ◽  
Matthew I. Campbell
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Process Modeling ◽  
Graph Transformation ◽  
Graph Grammar ◽  
Transformation Rules ◽  
The Neural Network ◽  
Network Topologies ◽  
Novel Method ◽  
Defining Graph

Neural networks are increasingly becoming a useful and popular choice for process modeling. The success of neural networks in effectively modeling a certain problem depends on the topology of the neural network. Generating topologies manually relies on previous neural network experience and is tedious and difficult. Hence there is a rising need for a method that generates neural network topologies for different problems automatically. Current methods such as growing, pruning and using genetic algorithms for this task are very complicated and do not explore all the possible topologies. This paper presents a novel method of automatically generating neural networks using a graph grammar. The approach involves representing the neural network as a graph and defining graph transformation rules to generate the topologies. The approach is simple, efficient and has the ability to create topologies of varying complexity. Two example problems are presented to demonstrate the power of our approach.

Multi-Agent System for Distributed Adaptive Design

2011 ◽  
Vol 486 ◽  
pp. 217-220 ◽  
Author(s):  
Leszek Kotulski ◽  
Barbara Strug
Keyword(s):  
Adaptive Design ◽  
Graph Transformation ◽  
Design System ◽  
Multi Agent System ◽  
Agent System ◽  
Parallel Application ◽  
Computational Costs ◽  
Transformation Rules ◽  
Multi Agent ◽  
Time Required

This paper deals with the design of a multi-agent system for distributed design. The design processes are often complex and require high computational costs. Yet in many situations many elements of a design process can be computed simultaneously and thus lowering the total time required to finish the design. In this paper an approach based on hypergraph representation and using a formal background of the parallel application of the graph transformation rules is presented (parallel derivation process). The system is illustrated with examples from the floor layout design system.

scholarly journals Lightweight Executability Analysis of Graph Transformation Rules

2010 ◽  
Author(s):  
Elena Planas ◽  
Jordi Cabot ◽  
Cristina Gomez ◽  
Esther Guerra ◽  
Juan de Lara
Keyword(s):  
Graph Transformation ◽  
Transformation Rules
Sign in / Sign up

Export Citation Format

Share Document