Right or Wrong ? – Verification of Model Transformations using Colored Petri Nets

Model-Driven Engineering (MDE) places models as firstclass artifacts throughout the software lifecycle requiring the availability of proper transformation languages. Most of today’s approaches use declarative rules to specify a mapping between source and target models which is then executed by a transformation engine. Transformation engines, however, most often hide the operational semantics of the mapping and operate on a considerable lower level of abstraction, thus hampering debugging. To tackle these limitations we propose a framework called TROPIC (Transformations on Petri Nets in Color) providing a DSL on top of Colored Petri Nets (CPNs) to specify, simulate, and formally verify model transformations. The formal underpinnings of CPNs enables simulation and verification of model transformations. By exploring the constructed state space of CPNs we show how predefined behavioral properties as well as custom state space functions can be applied for observing and tracking origins of errors during debugging.

[1]  Dániel Varró,et al.  Towards Testing the Implementation of Graph Transformations , 2008, Electron. Notes Theor. Comput. Sci..

[2]  Gerti Kappel,et al.  Reviving QVT Relations: Model-Based Debugging Using Colored Petri Nets , 2009, MoDELS.

[3]  Sami Evangelista,et al.  ASAP: An Extensible Platform for State Space Analysis , 2009, Petri Nets.

[4]  Dániel Varró,et al.  Termination Analysis of Model Transformations by Petri Nets , 2006, ICGT.

[5]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[6]  Lars Michael Kristensen,et al.  Finding Stubborn Sets of Coloured Petri Nets Without Unfolding , 1998, ICATPN.

[7]  van der Wmp Wil Aalst,et al.  PATTERNS IN COLORED PETRI NETS , 2005 .

[8]  Bernhard Rumpe,et al.  Model-driven Development of Complex Software : A Research Roadmap , 2007 .

[9]  W. Retschitzegger,et al.  Lets ’ s Play the Token Game – Model Transformations Powered By Transformation Nets ? , 2009 .

[10]  Hartmut Ehrig,et al.  Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation , 2009, CALCO.

[11]  Juan de Lara,et al.  Automating the transformation-based analysis of visual languages , 2009, Formal Aspects of Computing.

[12]  Jochen Malte Küster,et al.  Validation of model transformations: first experiences using a white box approach , 2006, MoDELS'06.

[13]  Krzysztof Czarnecki,et al.  Feature-based survey of model transformation approaches , 2006, IBM Syst. J..

[14]  Gerti Kappel,et al.  Lost in Translation? Transformation Nets to the Rescue! , 2009, UNISCON.

[15]  Dániel Varró,et al.  Automated formal verification of visual modeling languages by model checking , 2004, Software & Systems Modeling.

[16]  Lars Michael Kristensen,et al.  Coloured Petri Nets - Modelling and Validation of Concurrent Systems , 2009 .

[17]  Detlef Plump,et al.  Termination of Graph Rewriting is Undecidable , 1998, Fundam. Informaticae.

[18]  Werner Retschitzegger,et al.  Common Pitfalls of Using QVT Relations - Graphical Debugging as Remedy , 2009, 2009 14th IEEE International Conference on Engineering of Complex Computer Systems.