Termination Analysis of Model Transformations by Petri Nets

Despite the increasing relevance of model transformation techniques in model-driven software development, research is mainly conducted to the specification and the automation of such transformations. However, since the transformations themselves may also contain conceptual flaws, it is essential to formally analyze them prior to executing them on user models. In the current paper, we focus on a central validation problem of trusted model transformations, namely, termination and propose a Petri net based analysis method that provides a sufficient criterion for the termination problem of model transformations captured by graph transformation systems.

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

[2]  Francesca Rossi,et al.  Graph Processes , 1996, Fundam. Informaticae.

[3]  Uwe A Mann.  Graph Rewrite Systems For Program Optimization , 2000 .

[4]  Gabriele Taentzer,et al.  Efficient parsing of visual languages based on critical pair analysis and contextual layered graph transformation , 2000, Proceeding 2000 IEEE International Symposium on Visual Languages.

[5]  Juan de Lara,et al.  Automated Model Transformation and Its Validation Using AToM 3 and AGG , 2004, Diagrams.

[6]  Andrea Corradini,et al.  A Static Analysis Technique for Graph Transformation Systems , 2001, CONCUR.

[7]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[8]  Gabriele Taentzer,et al.  Termination of High-Level Replacement Units with Application to Model Transformation , 2005, Electron. Notes Theor. Comput. Sci..

[9]  Dániel Varró,et al.  Termination Criteria for Model Transformation , 2005, Transformation Techniques in Software Engineering.

[10]  Hartmut Ehrig,et al.  Integrating Meta-modelling Aspects with Graph Transformation for Efficient Visual Language Definition and Model Manipulation , 2004, FASE.

[11]  Arend Rensink,et al.  Graph Transformation Semantics for a QVT Language , 2008, Electron. Notes Theor. Comput. Sci..

[12]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[13]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[14]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

[15]  Andy Schürr,et al.  Specification of Graph Translators with Triple Graph Grammars , 1994, WG.

[16]  Andrea Corradini,et al.  Concurrent Graph and Term Graph Rewriting , 1996, CONCUR.

[17]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[18]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

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

[20]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[21]  J. Küster,et al.  Comparing Two Model Transformation Approaches , 2004 .

[22]  Paolo Baldan,et al.  Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars , 2000 .