Incremental model synchronization with precedence-driven triple graph grammars

  title={Incremental model synchronization with precedence-driven triple graph grammars},
  author={M. Lauder},
Triple Graph Grammars (TGGs) are a rule-based technique with a formal background for specifying bidirectional model transformation and, hence, can be applied to transform a given model into another and vice versa. In practice, models are either created from scratch by using a single input model, or incrementally synchronized by propagating changes between integrated models. The outstanding property of incremental model synchronization is that in average only small portions of the whole… Expand
Inter-Model Consistency Checking and Restoration with Triple Graph Grammars
This thesis establishes consistency checking as a novel use case of Triple Graph Grammars (TGGs) and proposes a novel consistency restoration procedure that exploits incremental pattern matching techniques to address the intermediate steps of consistency restoration in a simplified manner. Expand
Description Languages for Consistency Management Scenarios Based on Examples from the Industry Automation Domain
A description language for envisioned scenarios in the problem domain of consistency management, as well as a complementary description Language for solution strategies in terms of method fragments and method patterns in the solution domain of Model-Driven Engineering (MDE). Expand
A proposal for an interactive roundtrip engineering system
An interactive roundtrip engineering system for processing industry environments that uses a complementary rule-based transformation language to provide generation and synchronisation processes and an interactive concept is presented with a knowledge-based system and user interaction. Expand
An algorithm for generating model-sensitive search plans for pattern matching on EMF models
A dynamic-programming-based algorithm, which is able to handle general n-ary constraints in an integrated manner, collects statistical data from the underlying EMF model and uses this information for optimization purposes. Expand


Efficient Model Synchronization with Precedence Triple Graph Grammars
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. Expand
Incremental model synchronization with triple graph grammars
This paper employs the visual, formal, and bidirectional transformation technique of triple graph grammars, using this declarative specification formalism, and presents the approach to achieve an incremental model transformation for synchronization purposes. Expand
Concurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars
Correctness of concurrent model synchronization is shown, that is, each result of a nondeterministic concurrent update leads to a consistent correspondence between source and target models, where consistency is defined by the TGG. Expand
Bidirectional Model Transformation with Precedence Triple Graph Grammars
This paper introduces a new class of TGGs together with a control algorithm that drops a number of practice-relevant restrictions on TGG rules and still has a polynomial runtime complexity. Expand
From model transformation to incremental bidirectional model synchronization
This paper employs the visual, formal, and bidirectional transformation technique of triple graph grammars, and focuses on the efficient execution of the transformation rules and how to achieve an incremental model transformation for synchronization purposes. Expand
Correctness of model synchronization based on triple graph grammars
This paper provides a formal synchronization framework with bidirectional update propagation operations generated from a TGG, which specifies the language of all consistently integrated source and target models and shows that the generated synchronization framework is correct and complete. Expand
An Adaptable TGG Interpreter for In-Memory Model Transformations
This paper presents an idea for applying TGG trans- formations to models that have not been generated from the meta model underlying the TGG rules, and proposes a simple technique to start with, which can be extended in the future. Expand
Efficient and compatible bidirectional formal language translators based on extended triple graph grammars
The expressiveness of triple graph grammars is increased by supporting negative application conditions that allow to restrict the applicability of transformation rules, which is required in certain cases and by providing an efficiently working translation algorithm that still fulfills the properties correctness and completeness. Expand
Complex Attribute Manipulation in TGGs with Constraint-Based Programming Techniques
This work formalizes a TGG extension that provides a means for complex attribute manipulation in TGG rules, compatible with the existing TGG formalization, and retains the "single specification'' philosophy of TGGs. Expand
From Model Transformation to Model Integration based on the Algebraic Approach to Triple Graph Grammars
This paper presents model transformation and model integration as specific problem within bidirectional model transformation, which has shown to support various purposes, such as analysis, optimization, and code generation. Expand