Reference : Formal Specification of Model Transformations by Triple Graph Grammars with Applicati...
Scientific journals : Article
Engineering, computing & technology : Computer science
Formal Specification of Model Transformations by Triple Graph Grammars with Application Conditions
Golas, Ulrike [Konrad-Zuse-Zentrum f¨ur Informationstechnik Berlin, Germany]
Ehrig, Hartmut [Technische Universität Berlin, Germany]
Hermann, Frank mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Electronic Communications of the EASST
EASST (European Association of Software Science and Technology)
Yes (verified by ORBilu)
[en] model transformation ; triple graph grammar ; application condition
[en] Triple graph grammars are a successful approach to describe exogenous
model transformations, i.e. transformations between models conforming to different meta-models. Source and target models are related by some connection part,
triple rules describe the simultaneous construction of these parts, and forward and
backward rules can be derived modeling the forward and backward model transformations. As shown already for the specification of visual models by typed attributed
graph transformation, the expressiveness of the approach can be enhanced significantly by using application conditions, which are known to be equivalent to first
order logic on graphs.
In this paper, we extend triple rules with a specific form of application conditions,
which enhance the expressiveness of formal specifications for model transformations. We show how to extend results concerning information preservation, termination, correctness, and completeness of model transformations to the case with
application conditions. We illustrate our approach and results with a model transformation from statecharts to Petri nets.

File(s) associated to this reference

Fulltext file(s):

Open access
646-1979-1-PB(1).pdfPublisher postprint382.73 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.