Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Efficient Model Synchronization with Precedence Triple Graph Grammars
verfasst von : Marius Lauder, Anthony Anjorin, Gergely Varró, Andy Schürr
Erschienen in: Graph Transformations
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.