Leveraging Incremental Pattern Matching Techniques for Model Synchronisation

Self Cite

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. They can be used to automatically derive specifications of edit operations for single models and repair rules that propagate model changes to related models. model (re-)synchronization activities more effectively, a construction mechanism for shortcut rules has been recently developed. They describe consistency-preserving complex edit operations across model boundaries. We show that edit and repair rules can be derived from shortcut rules. As proof of concept, we implemented the construction and application of shortcut edit and repair rules in eMoflon. Our evaluation shows that shortcut rule based repair processes have considerably decreased data loss and improved runtime compared to former model synchronization processes in eMoflon.

Section: Introductory Examplementioning

confidence: 99%

Efficient Model Synchronization by Automatically Constructed Repair Processes

Fritsche

Kosiol

Schürr

et al. 2019

Self Cite

“…pairs of graphs connected by special correspondence-graphs, which resemble structural commonalities. From the grammar rules, procedures for consistency verification [27], model transformation [13] and (concurrent) model synchronization [19,18] can automatically be derived. The solution space, however, is limited to binary scenarios.…”

Section: Multimodel Equivalencementioning

confidence: 99%

Towards Multiple Model Synchronization with Comprehensive Systems

Stünkel

König

Lamo

et al. 2020

Model management is a central activity in Software Engineering. The most challenging aspect of model management is to keep models consistent with each other while they evolve. As a consequence, there has been increasing activity in this area, which has produced a number of approaches to address this synchronization challenge. The majority of these approaches, however, is limited to a binary setting; i.e. the synchronization of exactly two models with each other. A recent Dagstuhl seminar on multidirectional transformations made it clear that there is a need for further investigations in the domain of general multiple model synchronization simply because not every multiary consistency relation can be factored into binary ones. However, with the help of an auxiliary artifact, which provides a global view over all models, multiary synchronization can be achieved by existing binary model synchronization means. In this paper, we propose a novel comprehensive system construction to produce such an artifact using the same underlying base modelling language as the one used to define the models. Our approach is based on the definition of partial commonalities among a set of aligned models. Comprehensive systems can be shown to generalize the underlying categories of graph diagrams and triple graph grammars and can efficiently be implemented in existing tools.

“…With a focus on guaranteeing polynomial runtime, Klar et al [16] present a translation algorithm with polynomial runtime for correct and complete TGG-based unidirectional model transformation. Klar et al restrict the class of supported NACs to NACs that are only used to guarantee schema compliance, arguing that (i) such NACs can be supported efficiently, (ii) are still very useful in practice to guarantee schema compliance, and (iii) can also be efficiently supported by model synchronisation algorithms (as later demonstrated [19]). Anjorin et al [3] show that this restricted class of "schema compliance" NACs can be automatically generated from negative constraints and is thus equivalent to providing negative constraints together with a TGG.…”

Section: Related Workmentioning

confidence: 99%

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

Weidmann

Anjorin

2020

Self Cite

Triple Graph Grammars (TGGs) are a declarative and rulebased approach to bidirectional model transformation. The key feature of TGGs is the automatic derivation of various operations such as unidirectional transformation, model synchronisation, and consistency checking. Application conditions can be used to increase the expressiveness of TGGs by guaranteeing schema compliance, i.e., that domain constraints are respected by the TGG. In recent years, a series of new TGG-based operations has been introduced leveraging Integer Linear Programming (ILP) solvers to flexible consistency maintenance even in cases where no strict solution exists. Schema compliance is not guaranteed, however, as application conditions from the original TGG cannot be directly transferred to these ILP-based operations. In this paper, we extend ILP-based TGG operations so as to guarantee schema compliance. We implement and evaluate the practical feasibility of our approach.