A Simple Game-Theoretic Approach to Checkonly QVT Relations
The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models must be kept consistent in the face of changes to either. A QVT-R transformation can be used either in checkonly mode, to determine whether a target model is consistent with a given source model, or in enforce mode, to change the target model. Although the most obvious semantic issues in the QVT standard concern the restoration of consistency, in fact even checkonly mode is not completely straightforward; this mode is the focus of this paper. We need to consider the overall structure of the transformation as given by when and where clauses, and the role of trace classes. In the standard, the semantics of QVT-R are given both directly, and by means of a translation to QVT Core, a language which is intended to be simpler. In this paper, we argue that there are irreconcilable differences between the intended semantics of QVT-R and those of QVT Core, so that the translation cannot be helpful. Treating QVT-R directly, we propose a simple game-theoretic semantics. We demonstrate that consistent models may not possess a single trace model whose objects can be read as traceability links in either direction. We briefly discuss the effect of variations in the rules of the game, to elucidate some design choices available to the designers of the QVT-R language.
KeywordsTarget Model Winning Strategy Traceability Link Transformation Language Trace Model
Unable to display preview. Download preview PDF.
- 1.Garcia, M.: Formalization of QVT-Relations: OCL-based Static Semantics and Alloy-based Validation. In: Proceedings of the Second Workshop on MDSD Today, October 2008, pp. 21–30 (2008)Google Scholar
- 5.OMG. MOF2.0 query/view/transformation (QVT) version 1.0. OMG document formal/2008-04-03 (2008), www.omg.org
- 7.Stevens, P.: A landscape of bidirectional model transformations. In: Lämmel, R., Visser, J., Saraiva, J. (eds.) GTTSE 2007. LNCS, vol. 5235, pp. 408–424. Springer, Heidelberg (2008)Google Scholar
- 8.Stevens, P.: Towards an algebraic theory of bidirectional transformations. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 1–17. Springer, Heidelberg (2008)Google Scholar
- 9.Stevens, P.: Bidirectional model transformations in QVT: Semantic issues and open questions. Journal of Software and Systems Modeling, SoSyM (2009) (to appear)Google Scholar
- 10.Stirling, C.: Bisimulation, model checking and other games. In: Notes for Mathfit Instructural Meeting on Games and Computation (1997), http://homepages.inf.ed.ac.uk/cps/mathfit.ps
- 11.Tenzer, J., Stevens, P.: GUIDE: Games with UML for interactive design exploration. Journal of Knowledge Based Systems 20(7) (October 2007)Google Scholar