Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Specification of Graph Translators with Triple Graph Grammars
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Tool integration at the meta-model level: the Fujaba approach
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tool integration applications and frameworks
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Metamodel-based tool integration with moflon
Proceedings of the 30th international conference on Software engineering
On the relationship of model transformations based on triple and plain graph grammars
Proceedings of the third international workshop on Graph and model transformations
Verification and validation of declarative model-to-model transformations through invariants
Journal of Systems and Software
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Tool Integration with Triple Graph Grammars - A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Information preserving bidirectional model transformations
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Delaying constraint solving in symbolic graph transformation
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Extended triple graph grammars with efficient and compatible graph translators
Graph transformations and model-driven engineering
Toward Bridging the Gap between Formal Semantics and Implementation of Triple Graph Grammars
MODEVVA '10 Proceedings of the 2010 Workshop on Model-Driven Engineering, Verification, and Validation
Model view management with triple graph transformation systems
ICGT'06 Proceedings of the Third international conference on Graph Transformations
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Hi-index | 0.00 |
Triple graph grammars (TGGs) are a common formalism to specify model transformations in a relational way, creating source and target models together with their correspondences. The classical theoretical model of triple graphs is based on a morphism span from the correspondence component to the source and target components. In practice, this formalization often can not be used as for certain applications no proper morphisms between the correspondence and source or target components can be found. In this paper, we introduce TGGs as plain graph grammars with special typing which avoids an extra flattening step and is more directly suitable for implementation and formal analysis due to the more flexible and homogeneous formalization. The typing expresses that each graph can be partitioned into a source, correspondence, and target component allowing arbitrary relationships between the components. We further show that the main decomposition and composition result, which is the formal basis for correctness, completeness, consistency, and functional behavior, holds analogous to the classical approach and demonstrate that classical triple graph transformation is actually a special case – after flattening – of the more flexible one.