Abstract
Triple graph grammars are a successful approach to describe exogenous model transformations, i.e. transformations between models conforming to differ- ent 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 transfor- mations. As shown already for the specification of visual models by typed attributed graph transformation, the expressiveness of the approach can be enhanced signifi- cantly 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 transforma- tions. We show how to extend results concerning information preservation, termi- nation, correctness, and completeness of model transformations to the case with application conditions. We illustrate our approach and results with a model trans- formation from statecharts to Petri nets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Electronic Communication of The European Association of Software Science and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.