Generating Graph Transformation Rules from AML/GT State Machine Diagrams for Building Animated Model Editors

2012 ◽  
pp. 65-80 ◽  
Author(s):  
Torsten Strobl ◽  
Mark Minas
Keyword(s):  
Graph Transformation ◽  
State Machine ◽  
Transformation Rules ◽  
Generating Graph

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

Double-pushout graph transformation revisited

2001 ◽  
Vol 11 (5) ◽  
pp. 637-688 ◽  
Author(s):  
ANNEGRET HABEL ◽  
JÜRGEN MÜLLER ◽  
DETLEF PLUMP
Keyword(s):  
Traditional Approach ◽  
Graph Transformation ◽  
Right Hand ◽  
Generating Graph ◽  
Transformation Systems ◽  
Graph Transformation Systems ◽  
Parallelism And Concurrency ◽  
Arbitrary Matching ◽  
Graph Languages

In this paper we investigate and compare four variants of the double-pushout approach to graph transformation. As well as the traditional approach with arbitrary matching and injective right-hand morphisms, we consider three variations by employing injective matching and/or arbitrary right-hand morphisms in rules. We show that injective matching provides additional expressiveness in two respects: for generating graph languages by grammars without non-terminals and for computing graph functions by convergent graph transformation systems. Then we clarify for each of the three variations whether the well-known commutativity, parallelism and concurrency theorems are still valid and – where this is not the case – give modified results. In particular, for the most general approach with injective matching and arbitrary right-hand morphisms, we establish sequential and parallel commutativity by appropriately strengthening sequential and parallel independence.

Using a Graph Transformation System to Improve the Quality of Characteristics of UML-RT Specifications

2011 ◽  
pp. 20-46
Author(s):  
Lars Gunske
Keyword(s):  
Data Structure ◽  
Graph Transformation ◽  
Quality Characteristics ◽  
Specification Language ◽  
Software System ◽  
Transformation System ◽  
Transformation Rules ◽  
Architecture Evolution

This chapter presents the concept of graph-based architecture evolution and how this concept can be applied to improve the quality characteristics of a software system. For this purpose, the UML-RT used as an architectural specification language is mapped to a hypergraph-based data structure. Thus, transformation operators can be specified as hypergraph transformation rules and applied automatically.

Sign in / Sign up

Export Citation Format

Share Document