Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
van Glabbeek, R.J.: The linear time – branching time spectrum I; the semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch. 1, pp. 3–99. Elsevier, Amsterdam (2001)
Greenyer, J., Kindler, E.: Reconciling TGGs with QVT. In: Engels, G., Opdyke, B., Schmidt, D.C., Weil, F. (eds.) MODELS 2007. LNCS, vol. 4735, pp. 16–30. Springer, Heidelberg (2007)
Martin, D.A.: Borel determinacy. Annals of Mathematics. Second series 102(2), 363–371 (1975)
OMG. MOF2.0 query/view/transformation (QVT) version 1.0. OMG document formal/2008-04-03 (2008), www.omg.org
Romeikat, R., Roser, S., Müllender, P., Bauer, B.: Translation of QVT relations into QVT operational mappings. In: Vallecillo, A., Gray, J., Pierantonio, A. (eds.) ICMT 2008. LNCS, vol. 5063, pp. 137–151. Springer, Heidelberg (2008)
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)
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)
Stevens, P.: Bidirectional model transformations in QVT: Semantic issues and open questions. Journal of Software and Systems Modeling, SoSyM (2009) (to appear)
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
Tenzer, J., Stevens, P.: GUIDE: Games with UML for interactive design exploration. Journal of Knowledge Based Systems 20(7) (October 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stevens, P. (2009). A Simple Game-Theoretic Approach to Checkonly QVT Relations. In: Paige, R.F. (eds) Theory and Practice of Model Transformations. ICMT 2009. Lecture Notes in Computer Science, vol 5563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02408-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-02408-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02407-8
Online ISBN: 978-3-642-02408-5
eBook Packages: Computer ScienceComputer Science (R0)