A formalisation of constraint-aware model transformations

8Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper introduces a formal approach to the definition of constraint-aware model transformations. The proposed approach is based on the Diagram Predicate Framework and extends graph transformations with the ability to handle constraints in the definition and execution of model transformations. In particular, it uses non-deleting rules that are typed over the metamodel of a joined modelling language which is constructed from the source and target languages. Furthermore, the application of transformation rules is formalised as a pushout construction that creates a model which is typed over the metamodel of the joined modelling language. Finally, the target model is obtained from the created model by a pullback construction. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Rutle, A., Rossini, A., Lamo, Y., & Wolter, U. (2010). A formalisation of constraint-aware model transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6013 LNCS, pp. 13–28). https://doi.org/10.1007/978-3-642-12029-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free