A precedence-driven approach for concurrent model synchronization scenarios using triple graph grammars

  title={A precedence-driven approach for concurrent model synchronization scenarios using triple graph grammars},
  author={Lars Fritsche and Jens Kosiol and Adrian M{\"o}ller and Andy Sch{\"u}rr and Gabriele Taentzer},
  journal={Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering},
  • Lars Fritsche, Jens Kosiol, +2 authors G. Taentzer
  • Published 6 November 2020
  • Computer Science
  • Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering
Concurrent model synchronization is the task of restoring consistency between two correlated models after they have been changed concurrently and independently. To determine whether such concurrent model changes conflict with each other and to resolve these conflicts taking domain- or user-specific preferences into account is highly challenging. In this paper, we present a framework for concurrent model synchronization algorithms based on Triple Graph Grammars (TGGs). TGGs specify the… 
Comprehensive Systems: A formal foundation for Multi-Model Consistency Management
This paper proposes and investigates a novel comprehensive system construction, which is able to represent multi-ary relations among multiple models in an integrated manner and thus serves as a formal foundation for artefacts used in consistency management activities involving multiple models.
Commutative Event Sourcing vs. Triple Graph Grammars
This paper proposes Commutative Event Sourcing as a simple and reliable mechanism for model synchronisation, bidirectional model to model transformations, incremental updates, and collaborative
A Generalized Concurrent Rule Construction for Double-Pushout Rewriting
This work extends and generalizes the Concurrency Theorem by introducing generalized concurrent rules (GCRs), whose distinguishing property is that they allow identifying and preserving elements that are deleted by their first underlying rule and created by the second one.
Concurrent model synchronisation with multiple objectives
This work investigates on whether it is beneficial to apply heuristics to solve concurrent model synchronisation problems and proposes a method to determine suitable weightings for aggregating all objectives into a single function.


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.
Inter-model Consistency Checking Using Triple Graph Grammars and Linear Optimization Techniques
This paper formulate decisions between single rule applications of a consistency check as integer inequalities, which serve as input for an optimization problem used to detect maximum consistent portions of two models.
Correctness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars
This paper generalises the approach to arbitrary TGGs and considers nondeterministic operations which might yield different results and require backtracking, and provides a technique for reducing and possibly eliminating backtracking to improve efficiency.
On Propagation-Based Concurrent Model Synchronization
This paper first state some properties that, in the author's opinion, must be satisfied by a concurrent synchronization procedure to be considered correct, and shows how to check whether the given updates are conflict-free and presents a correct synchronization procedure based on this check.
Decision Points for Non-determinism in Concurrent Model Synchronization with Triple Graph Grammars
A triple graph based synchronization approach is analysed to identify decisions, extend the approach to clearly separate them and discuss the relation to formal properties of model synchronization.
Synchronizing concurrent model updates based on bidirectional transformation
It is shown that synchronizers produced by the algorithm are ensured to satisfy the three properties if the bidirectional transformation satisfies the correctness property and the hippocraticness property, and that the history ignorance property contributes to the symmetry of the algorithm.
Avoiding Unnecessary Information Loss: Correct and Efficient Model Synchronization Based on Triple Graph Grammars
This paper shows how to automatically derive (short-cut) repair rules from short-cut rules to propagate changes such that information loss is avoided and model synchronization is accelerated and proves the termination and the correctness of this synchronization process.
Efficient Model Synchronization by Automatically Constructed Repair Processes
This work implemented the construction and application of short-cut edit and repair rules in eMoflon and shows that short- cut-rule-based repair processes have considerably decreased data loss and improved runtime compared to former model synchronization processes in e Moflon.
Model synchronization based on triple graph grammars: correctness, completeness and invertibility
This paper provides a formal synchronization framework with bidirectional update propagation operations generated from a given TGG, which specifies the language of all consistently integrated source and target models.
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.