Article (Scientific journals)
Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions
Ehrig, Hartmut; Hermann, Frank; Sartorius, Christoph
2009In Electronic Communications of the EASST, 18
Peer Reviewed verified by ORBi


Full Text
Publisher postprint (448.36 kB)

All documents in ORBilu are protected by a user license.

Send to


Keywords :
model transformation; triple graph grammars; completeness; correct- ness; negative application conditions
Abstract :
[en] Model transformations are a key concept for modular and distributed model driven development. In this context, triple graph grammars have been inves- tigated and applied to several case studies and they show a convenient combination of formal and intuitive speci?cation abilities. Especially the automatic derivation of forward and backward transformations out of just one specified set of rules for the integrated model simplifies the specification and enhances usability as well as consistency. Since negative application conditions (NACs) are key ingredient for many model transformations based on graph transformation we embed them in the concept of triple graph grammars. As a first main result we can extend the composi- tion/decomposition result for triple graph grammars to the case with NACs. This allows us to show completeness and correctness of model transformations based on rules with NACs and furthermore, we can extend the characterization of information preserving model transformations to the case with NACs. The presented results are applicable to several model transformations and in partic- ular to the well known model transformation from class diagrams to relational data bases, which we present as running example with NACs.
Disciplines :
Computer science
Author, co-author :
Ehrig, Hartmut
Hermann, Frank ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Sartorius, Christoph
Language :
Title :
Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions
Publication date :
Journal title :
Electronic Communications of the EASST
Publisher :
European Association of Software Science and Technology
Special issue title :
Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'09)
Volume :
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBilu :
since 05 September 2013


Number of views
58 (1 by Unilu)
Number of downloads
180 (1 by Unilu)

Scopus citations®
Scopus citations®
without self-citations


Similar publications

Contact ORBilu