Abstract
Existing bidirectional model transformation languages are mainly state-based: a transformation is considered composed from functions whose inputs and outputs only consist of original and updated models, but alignment relationships between the models are not specified. In the paper we identify and discuss three major problems caused by this under-specification. We then propose a novel formal framework based on a graphical language: models are nodes and updates are arrows, and show how the three problems can be fixed. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Diskin, Z., Xiong, Y., & Czarnecki, K. (2010). From state- to delta-based bidirectional model transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6142 LNCS, pp. 61–76). https://doi.org/10.1007/978-3-642-13688-7_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
