Efficient model synchronization with precedence triple graph grammars

DOI10.1007/978-3-642-33654-6_27MaRDI QIDQ2918996zbMATH OpenOpenAlexFDO

Authors Marius Lauder, A. Anjorin, Gergely Varró, Andy Schürr

Publication date 2 October 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33654-6_27

zbMATH Keywords

control algorithm of incremental transformationsmodel synchronizationnode precedence analysistriple graph grammars

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Leveraging incremental pattern matching techniques for model synchronisation
• Formal analysis of model transformations based on triple graph grammars
• Incremental concurrent model synchronization using triple graph grammars
• Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming
• A static analysis of non-confluent triple graph grammars for efficient model transformation

Cited in

(12)

• An introduction to triple graph grammars as an implementation of the delta-lens framework
• Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
• Graph transformation with incremental updates
• Multi-amalgamated triple graph grammars
• Extended triple graph grammars with efficient and compatible graph translators
• A static analysis of non-confluent triple graph grammars for efficient model transformation
• Non-materialized Model View Specification with Triple Graph Grammars
• Leveraging incremental pattern matching techniques for model synchronisation
• Incremental concurrent model synchronization using triple graph grammars
• Inter-model consistency checking using triple graph grammars and linear optimization techniques
• Advanced consistency restoration with higher-order short-cut rules
• Advanced model consistency restoration with higher-order short-cut rules

This page was built for publication: Efficient model synchronization with precedence triple graph grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918996)