Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
A Design Environment for Migrating Relational to Object Oriented Database Systems
ICSM '96 Proceedings of the 1996 International Conference on Software Maintenance
Confluence of Typed Attributed Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on 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
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Satellite Events at the MoDELS 2005 Conference: MoDELS 2005 International Workshop OCLWS, MoDeVA, MARTES, AOM, MTiP, WiSME, MODAUI, Nfc, MDD, WUsCaM, Montego ... Papers (Lecture Notes in Computer Science)
Explicit State Model Checking for Graph Grammars
Concurrency, Graphs and Models
15 Years of Triple Graph Grammars
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Bidirectional Transformations: A Cross-Discipline Perspective
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Information preserving bidirectional model transformations
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Incremental model synchronization with triple graph grammars
MoDELS'06 Proceedings of the 9th international conference on Model Driven Engineering Languages and Systems
A graphical specification of model transformations with triple graph grammars
ECMDA-FA'05 Proceedings of the First European conference on Model Driven Architecture: foundations and Applications
Controlling reuse in pattern-based model-to-model transformations
Graph transformations and model-driven engineering
Dagstuhl seminar on bidirectional transformations (BX)
ACM SIGMOD Record
Correctness of model synchronization based on triple graph grammars
Proceedings of the 14th international conference on Model driven engineering languages and systems
Concurrent model synchronization with conflict resolution based on triple graph grammars
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Bidirectional model transformation with precedence triple graph grammars
ECMFA'12 Proceedings of the 8th European conference on Modelling Foundations and Applications
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Construction of integrity preserving triple graph grammars
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Efficient model synchronization with precedence triple graph grammars
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Bridging the gap between formal semantics and implementation of triple graph grammars
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
Model-based software development processes often force their users to translate instances of one modeling language into related instances of another modeling language and vice-versa. The underlying data structure of such languages usually are some sort of graphs. Triple graph grammars (TGGs) are a formally founded language for describing correspondence relationships between two graph languages in a declarative way. Bidirectional graph language translators can be derived from a TGG, which maps pairs of related graph instances onto each other. These translators must fulfill certain compatibility properties with respect to the correspondence relationships established by their TGG. These properties are guaranteed for the original TGG approach as published 15 years ago. However, its expressiveness is pushed to the limit in most real world scenarios. Furthermore, the original approach relies on a parsing algorithm with exponential runtime complexity. In this contribution, we study a more expressive class of TGGs with negative application conditions and show for the first time that derived translators with a polynomial runtime complexity still preserve the above mentioned compatibility properties. For this purpose, we introduce a new characterization of wellformed TGGs together with a new translation rule scheduling algorithm that considers dangling edges of input graphs.