Hartmut Ehrig
Frank Hermann
ABSTRACT
Triple graph grammars have been applied and implemented as a formal basis for model transformations in a variety of application areas. They convince by special abilities in automatic derivation of forward, backward and several other transformations out of just one specified set of rules for the integrated model defined by a triple of graphs. While many case studies and all implementations, which state that they are using triple graph grammars, do not use triples of graphs, this paper presents the justification for many of them. It shows a one to one correspondence between triple graph grammars and suitable plain graph grammars, thus results and benefits of the triple case can be transferred to the plain case.
Main results show the relationship between both graph transformation approaches, syntactical correctness of model transformations based on triple graph grammars and a sound and complete condition for functional behaviour. Theoretical results are elaborated on an intuitive case study for a model transformation from class diagrams to database models.
- AGG Homepage. http://tfs.cs.tu-berlin.de/agg.Google Scholar
- N. Aschenbrenner and L. Geiger. Transforming scene graphs using Triple Graph Grammars - A practice report. In Proc. Symposium on Applications of Graph Transformation with Industrial Relevance, 2007.Google Scholar
- J. Bézivin, B. Rumpe, A. Schürr, and L. Tratt. Model transformations in practice workshop. In Proc. MoDELS Satellite Events, volume 3844 of LNCS, pages 120--127. Springer, 2005. Google ScholarDigital Library
- J. de Lara and E. Guerra. Model View Management with Triple Graph Grammars. In Proc. Conf. on Graph Transformation (ICGT'06), volume 4178 of LNCS, pages 351--366. Springer, 2006. Google ScholarDigital Library
- J. de Lara, H. Vangheluwe and M. Alfonseca. Meta-Modelling and Graph Grammars for Multi-Paradigm Modelling in AToM3, Software and System Modeling, 3(3), pages 194--209. Springer, 2004. http://atom3.cs.mcgill.ca/.Google ScholarDigital Library
- H. Ehrig, K. Ehrig, C. Ermel, F. Hermann, and G. Taentzer. Information preserving bidirectional model transformations. In Proc. Fundamental Approaches to Software Engineering (FASE'07), volume 4422 of LNCS, pages 72--86. Springer, 2007. Google ScholarDigital Library
- H. Ehrig, K. Ehrig, A. Habel, and K.-H. Pennemann. Theory of Constraints and Application Conditions: From Graphs to High-Level Structures. Fundamenta Informaticae, 74(1):135--166, 2006. Google ScholarDigital Library
- H. Ehrig, K. Ehrig, and F. Hermann. From Model Transformation to Model Integration based on the Algebraic Approach to Triple Graph Grammars. In Proc. Workshop on Graph Transformation and Visual Modelling Techniques. EC-EASST, 2008.Google Scholar
- H. Ehrig, K. Ehrig, U. Prange, and G. Taentzer. Fundamentals of Algebraic Graph Transformation. EATCS Monographs. Springer Verlag, 2006. Google ScholarDigital Library
- H. Giese and R. Wagner. Incremental Model Synchronization and Transformation with Triple Graph Grammars. In Proc. Conf. on Model Driven Engineering Languages and Systems (MoDELS), LNCS. Springer, 2006. Google ScholarDigital Library
- J. Greenyer and E. Kindler. Reconciling TGGs with QVT. In Proc. Conf. on Model Driven Engineering Languages and Systems (MoDELS'07), volume 4735 of LNCS, pages 16--30. Springer, 2006. Google ScholarDigital Library
- A. Habel, R. Heckel, and G. Taentzer. Graph Grammars with Negative Application Conditions. Special issue of Fundamenta Informaticae, 26(3,4):287--313, 1996. Google ScholarDigital Library
- E. Kindler and R. Wagner. Triple graph grammars: Concepts, extensions, implementations, and application scenarios. Technical Report tr-ri-07-284, University of Paderborn, 2007.Google Scholar
- Object Management Group. OMG Unified Modeling Language (OMG UML), Superstructure, V2.1.2, November 2007.Google Scholar
- OMG. MOF QVT Final Adopted Specification. http://www.omg.org/docs/ptc/05-11-01.pdf, 2005.Google Scholar
- A. Schürr. Specification of Graph Translators with Triple Graph Grammars. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science, volume 903 of LNCS, pages 151--163. Springer, 1994. Google ScholarDigital Library
- H. Ehrig, C. Ermel and F. Hermann. On the Relationship of Model Transformations Based on Triple and Plain Graph Grammars (Long Version), Technical Report TR 2008-05. TU Berlin, 2008.Google Scholar
- Software Engineering Group, University of Paderborn. Fujaba Tool Suite, 2007. http://wwwcs.uni-paderborn.de/cs/ag-schaefer/Lehre/PG/Fujaba/projects/tgg/index.html.Google Scholar
Index Terms
- On the relationship of model transformations based on triple and plain graph grammars
Recommendations
Formal analysis of functional behaviour for model transformations based on triple graph grammars
ICGT'10: Proceedings of the 5th international conference on Graph transformationsTriple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already crucial properties of model transformations like termination, correctness and ...
On-the-Fly Construction, Correctness and Completeness of Model Transformations Based on Triple Graph Grammars
MODELS '09: Proceedings of the 12th International Conference on Model Driven Engineering Languages and SystemsTriple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rules for bidirectional model transformations, which simplifies specification ...
15 Years of Triple Graph Grammars
ICGT '08: Proceedings of the 4th international conference on Graph TransformationsTriple graph grammars (TGGs) have been invented 15 years ago as a formalism for the declarative specification of bidirectional graph-to-graph translations. In this paper we present a list of still open problems concerning the interpretation and the ...
Comments