Avoiding Unnecessary Information Loss: Correct and Efficient Model Synchronization Based on Triple Graph Grammars
Lars Fritsche, Jens Kosiol, Andy Sch\"urr, Gabriele Taentzer

TL;DR
This paper introduces an automated method for model synchronization using derived repair rules from triple graph grammars, reducing information loss and improving efficiency in maintaining model consistency.
Contribution
It presents a novel approach to derive repair rules from short-cut rules to enhance model synchronization, minimizing unnecessary element deletion and recreation.
Findings
Reduced information loss in model synchronization.
Improved performance of synchronization process.
Validated correctness and termination of the method.
Abstract
Model synchronization, i.e., the task of restoring consistency between two interrelated models after a model change, is a challenging task. Triple Graph Grammars (TGGs) specify model consistency by means of rules that describe how to create consistent pairs of models. These rules can be used to automatically derive further rules, which describe how to propagate changes from one model to the other or how to change one model in such a way that propagation is guaranteed to be possible. Restricting model synchronization to these derived rules, however, may lead to unnecessary deletion and recreation of model elements during change propagation. This is inefficient and may cause unnecessary information loss, i.e., when deleted elements contain information that is not represented in the second model, this information cannot be recovered easily. Short-cut rules have recently been developed to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
