Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Towards an Algebraic Theory of Bidirectional Transformations
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
15 Years of Triple Graph Grammars
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Information preserving bidirectional model transformations
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
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
Preventing information loss in incremental model synchronization by reusing elements
ECMFA'11 Proceedings of the 7th European conference on Modelling foundations and applications
From state- to delta-based bidirectional model transformations: the symmetric case
Proceedings of the 14th international conference on Model driven engineering languages and systems
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
| Hi-index | 0.00 |
Triple Graph Grammars (TGGs) are a rule-based technique with a formal background for specifying bidirectional and incremental model transformation. In practical scenarios, unidirectional rules for incremental forward and backward transformation are automatically derived from the TGG rules in the specification, and the overall transformation process is governed by a control algorithm. Current incremental implementations either have a runtime complexity that depends on the size of related models and not on the number of changes and their affected elements, or do not pursue formalization to give reliable predictions regarding the expected results. In this paper, a novel incremental model synchronization algorithm for TGGs is introduced, which employs a static analysis of TGG specifications to efficiently determine the range of influence of model changes, while retaining all formal properties.