Formal Support for QVT-Relations with Coloured Petri Nets

Lara, Juan de; Guerra, Esther

doi:10.1007/978-3-642-04425-0_19

Cited by 15 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also plan to perform a detailed study of the expressivity of different mechanisms for reuse of other bidirectional languages, like TGGs and QVT-R, by using realistic examples. Finally, we are also investigating other languages for the operational mechanisms, like Coloured Petri Nets, in the style of [5].…”

Section: Discussionmentioning

confidence: 99%

Controlling Reuse in Pattern-Based Model-to-Model Transformations

Guerra

Lara

Orejas

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Model-to-model transformation is a central activity in Model-Driven Engineering that consists of transforming models from a source to a target language. Pattern-based model-to-model transformation is our approach for specifying transformations in a declarative, relational and formal style. The approach relies on patterns describing allowed or forbid-den relations between two models. These patterns are compiled into oper-ational mechanisms to perform forward and backward transformations.Inspired by QVT-Relations, in this paper we incorporate into our framework the so-called check-before-enforce semantics, which checks the existence of suitable elements before creating them (i.e. it promotes reuse). Moreover, we enable the use of keys in order to describe when two elements are considered equal. The presented techniques are illustrated with a bidirectional transformation between Web Services Description Language and Enterprise Java Beans models.

show abstract

Section: Discussionmentioning

confidence: 99%

Controlling Reuse in Pattern-Based Model-to-Model Transformations

Guerra

Lara

Orejas

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Unfortunately, as discussed at length in [12], the claim in [8] that QVT-R can be translated in a semantics-preserving way to QVT Core is not sustainable (QVT Core is insufficiently expressive), so this approach does not lead to a semantics for QVT-R. The same problem may apply to [4] which a semantics for QVT-R enforce mode (with both unidirectional and acyclic restrictions) using coloured petri nets; it states that it is consistent with [8]'s incorrect translation to QVT Core. Another paper in this tradition is [14] which discusses using CPN theory as implemented in a model transformation framework called TROPIC to provide debugging facilities for QVT-R transformations.…”

Section: Related Workmentioning

confidence: 99%

Enforcing QVT-R with mu-Calculus and Games

Bradfield

Stevens

2013

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. QVT-R is the standard Object Management Group bidirectional transformation language. In previous work, we gave a precise game-theoretic semantics for the checkonly semantics of QVT-R transformations, including the recursive invocation of relations which is allowed and used, but not defined, by the QVT standard. In this paper, we take up the problem of enforce semantics, where the standard attempts formality, but at crucial points lapses into English. We show that our previous semantics can be extended to enforce mode, giving a precise semantics taking the standard into account.

show abstract

“…In [12], inspired by the standard compilation of QVT-R into QVT-C, the authors translate QVT-R into triple graph grammars which in this case play the role of QVT-C. In [6], we compiled QVT-R specifications into coloured Petri nets for execution, debug and analysis. Finally, the authors in [11] formalize both QVT-R and QVT-O by using theory of problems, being able to verify whether a QVT-O specification is correct with respect to a QVT-R specification.…”

Section: Related Workmentioning

confidence: 99%

An Algebraic Semantics for QVT-Relations Check-only Transformations

Guerra

Lara

2012

Fundamenta Informaticae

Self Cite

View full text Add to dashboard Cite

Esta es la versión de autor del artículo publicado en: This is an author produced version of a paper published in: Fundamenta Informaticae 114.1 (2012): 73-101El acceso a la versión del editor puede requerir la suscripción del recurso Access to the published version may require subscription Fundamenta Informaticae XXI (2010) 1-33 1 IOS PressAbstract. QVT is the standard for model transformation defined by the OMG in the context of the Model-Driven Architecture. It is made of several transformation languages. Among them, QVT-Relations is the one with the highest level of abstraction, as it permits developing bidirectional transformations in a declarative, relational style. Unfortunately, the standard only provides a semiformal description of its semantics, which hinders analysis and has given rise to ambiguities in existing tool implementations.In order to improve this situation, we propose a formal, algebraic semantics for QVT-Relations check-only transformations, defining a notion of satisfaction of QVT-Relations specifications by models.

show abstract

Formal Support for QVT-Relations with Coloured Petri Nets

Cited by 15 publications

References 8 publications

Controlling Reuse in Pattern-Based Model-to-Model Transformations

Controlling Reuse in Pattern-Based Model-to-Model Transformations

Enforcing QVT-R with mu-Calculus and Games

An Algebraic Semantics for QVT-Relations Check-only Transformations

Contact Info

Product

Resources

About