In: Lecture Notes in Computer Science : Graph Transformations, Volume 4178, 2006, pages 260-274. 2006. URL: http://dx.doi.org/10.1007/1184188319.
Abstract: 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.
Keywords: graph transformation; termination; model transformation; Petri nets.