Efficient Model Synchronization with Precedence Triple Graph Grammars

DOI10.1007/978-3-642-33654-6_27zbMath1367.68143OpenAlexW1767562778MaRDI QIDQ2918996

Marius Lauder, Anthony 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

triple graph grammarsmodel synchronizationcontrol algorithm of incremental transformationsnode precedence analysis

Mathematics Subject Classification ID

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

Related Items (2)

Incremental Concurrent Model Synchronization using Triple Graph Grammars ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs

This page was built for publication: Efficient Model Synchronization with Precedence Triple Graph Grammars