Reference : Model synchronization based on triple graph grammars: correctness, completeness and i...
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/4552
Model synchronization based on triple graph grammars: correctness, completeness and invertibility
English
Hermann, Frank mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Ehrig, Hartmut mailto []
Orejas, Fernando []
Czarnecki, Krzysztof []
Diskin, Zinovy []
Xiong, Yingfei []
Gottmann, Susann mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Engel, Thomas mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Jan-2013
Software & Systems Modeling
Springer Science & Business Media B.V.
Yes (verified by ORBilu)
International
1619-1366
[en] Triple graph grammars (TGGs) have been used successfully to analyze correctness and completeness of bidirectional model transformations, but a corresponding formal approach to model synchronization has been missing. This paper closes this gap by providing a formal synchronization framework with bidirectional update propagation operations. They are generated from a given TGG, which specifies the language of all consistently integrated source and target models. As our main result, we show that the generated synchronization framework is correct and complete, provided that forward and backward propagation operations are deterministic. Correctness essentially means that the propagation operations preserve and establish consistency while completeness ensures that the operations are defined for all possible inputs. Moreover, we analyze the conditions under which the operations are inverse to each other. All constructions and results are motivated and explained by a running example, which leads to a case study, using concrete visual syntax and abstract syntax notation based on typed attributed graphs.
Researchers
http://hdl.handle.net/10993/4552
10.1007/s10270-012-0309-1
http://link.springer.com/article/10.1007/s10270-012-0309-1
The final publication is available at link.springer.com

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
10.1007_s10270-012-0309-1(1).pdfPublisher postprint3.39 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.