## A Graphical Specification of Model Transformations with Triple Graph Grammars (2005)

### Cached

### Download Links

- [www.itee.uq.edu.au]
- [www.se.eecs.uni-kassel.de]
- DBLP

### Other Repositories/Bibliography

Venue: | In First European Conference Model Driven Architecture - Foundations and Applications, number 3748 in Lecture Notes in Computer Science |

Citations: | 11 - 0 self |

### BibTeX

@INPROCEEDINGS{Grunske05agraphical,

author = {Lars Grunske and Leif Geiger and Michael Lawley},

title = {A Graphical Specification of Model Transformations with Triple Graph Grammars},

booktitle = {In First European Conference Model Driven Architecture - Foundations and Applications, number 3748 in Lecture Notes in Computer Science},

year = {2005},

pages = {284--298},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. Models and model transformations are the core concepts of OMG’s MDA T M approach. Within this approach, most models are derived from the MOF and have a graph-based nature. In contrast, most of the current model transformations are specified textually. To enable a graphical specification of model transformation rules, this paper proposes to use triple graph grammars as declarative specification formalism. These triple graph grammars can be specified within the FUJABA tool and we argue that these rules can be more easily specified and they become more understandable and maintainable. To show the practicability of our approach, we present how to generate Tefkat rules from triple graph grammar rules, which helps to integrate triple graph grammars with a state of a art model transformation tool and shows the expressiveness of the concept. 1

### Citations

1329 | Refactoring: Improving the Design of Existing Code - Fowler, Beck, et al. - 2000 |

96 |
Graph-grammars: An algebraic approach
- Ehrig, Pfender, et al.
- 1973
(Show Context)
Citation Context ... an extension to the current model transformation languages. These graph transformation rules are a straightforward extension of string or term rewriting rules, which were introduced in the seventies =-=[4]-=- and are currently applied in various domains [5] to transform or rewrite graph-based structures. However, normal graph transformation rules and systems are only suitable to operate on one particular ... |

54 | Graph grammar engineering with PROGRES
- Schurr, Winter, et al.
- 1995
(Show Context)
Citation Context ...odel transformation, as they are needed to specify quality-improving refactorings [6–8]. To operate on two different graphs with two different graph schemata an extension called triple graph grammars =-=[9]-=- is suitable. These triple graph grammars and their rules are the theoretical foundation of this paper and we want to show their suitability for describing complex model-to-model transformations. Espe... |

44 | Hierarchical Graph Transformation
- Drewes, Hoffmann, et al.
(Show Context)
Citation Context ...ary number of source and target nodes. For the construction of hierarchical models, hierarchical graphs are important. These hierarchical graphs model the hierarchical structure either by (hyper)edge =-=[12]-=- or node refinement [17]. 2.2 Graph Transformation and Graph Transformation Systems Basic Principles Graph transformation systems make use of graph rewriting techniques to manipulate graphs. A graph t... |

42 | Formalising Behaviour Preserving Program Transformations
- Mens, Demeyer, et al.
- 2002
(Show Context)
Citation Context ...18, 19], where the formal foundations of the single pushout (SPO) and double pushout (DPO) approach are reviewed. Currently these approaches have the most impact in the graph transformation community =-=[5, 15, 8]-=-. Application Conditions In complex graph transformation systems it is often necessary to restrict the application of single rules. Therefore, in [20] the concept of positive and negative application ... |

36 | Tutorial Introduction to Graph Transformation: A Software Engineering Perspective
- Baresi, Heckel
- 2004
(Show Context)
Citation Context ...2.1 Directed Typed Graphs and Graph Morphisms We choose directed typed graphs as the basic structure, because they are well suited to specifying different types of models, especially MOF-based models =-=[15]-=-. These directed typed graphs contain nodes and edges that are instances of node and edge types. The instance relation between the nodes and edges and their types is similar to the relation between ob... |

35 |
A review of OMG
- Gardner, Griffin, et al.
- 2003
(Show Context)
Citation Context ...ery/ Views/ Transformations Request for Proposals (RFP) [2] from the OMG. For this RFP the OMG initially received eight proposals of varying degrees of completeness which are reviewed and assessed in =-=[3]-=-. A final revised, merged submission supported by all original submitters is expected to be voted for adoption at the June 2005 OMG meeting in Boston. This submission supports several flavours of tran... |

32 |
Hyperedge replacement grammars and languages, volume 643 of LNCS
- Habel
- 1992
(Show Context)
Citation Context ...ormation community. One basic variant uses undirected edges. These undirected edges can be modeled in a directed graph with two contrary edges for each undirected edge. Another variant are hypergraphs=-=[16]-=-, where each (hyper) edge is associated with a sequence of source and target node. That means, these edges can have an arbitrary number of source and target nodes. For the construction of hierarchical... |

10 | Integration tools supporting cooperative development processes in chemical engineering
- Becker, Haase, et al.
- 2002
(Show Context)
Citation Context ...e graph grammar rules is applied once to transform a model A to a model B and the correspondence graph is generated. This means you can create tools that update a model if the other has been changed. =-=[11, 9]-=- This change propagation is also bidirectional and is especially important for iterative software engineering processes where a model evolves continuously. – Triple graph grammars can be used to check... |

8 | Implementing Refactorings as Graph Rewrite Rules on a Platform Independent Meta model - Gorp, Eetvelde, et al. - 2003 |

8 | VARRÓ D.: Using graph transformation for practical model-driven software engineering
- GRUNSKE, GEIGER, et al.
- 2005
(Show Context)
Citation Context ...odel-to-model transformations. Especially, we argue that triple graph grammars provide the following benefits, which are useful for the specification and application of model-to-model transformations =-=[10]-=-: – Triple graph grammars allow incremental change propagations between two models A and B, if a model transformation system with triple graph grammar rules is applied once to transform a model A to a... |

8 | Formalizing Architectural Refactorings as Graph Transformation Systems - Grunske - 2005 |

7 |
Graph transformation for specification and programming, Science of Computer Programming 34
- Andries, Engels, et al.
- 1999
(Show Context)
Citation Context ... languages. These graph transformation rules are a straightforward extension of string or term rewriting rules, which were introduced in the seventies [4] and are currently applied in various domains =-=[5]-=- to transform or rewrite graph-based structures. However, normal graph transformation rules and systems are only suitable to operate on one particular graph. Thus, they are only suited to describe int... |

2 | Automated software architecture evolution with hypergraph transformation - Grunske - 2003 |