Formal Relationship between Petri Net and Graph Transformation Systems based on Functors between M-adhesive Categories

Various kinds of graph transformations and Petri net transformation systems are examples of M-adhesive transformation systems based on M-adhesive categories, generalizing weak adhesive HLR categories. For typed attributed graph transformation systems, the tool environment AGG allows the modeling, the simulation and the analysis of graph transformations. A corresponding tool for Petri net transformation systems, the RON-Environment, has recently been developed which implements and simulates Petri net transformations based on corresponding graph transformations using AGG. Up to now, the correspondence between Petri net and graph transformations is handled on an informal level. The purpose of this paper is to establish a formal relationship between the corresponding M-adhesive transformation systems, which allow the translation of Petri net transformations into graph transformations with equivalent behavior, and, vice versa, the creation of Petri net transformations from graph transformations. Since this is supposed to work for different kinds of Petri nets, we propose to define suitable functors, called M-functors, between different M-adhesive categories and to investigate properties allowing us the translation and creation of transformations of the corresponding M-adhesive transformation systems.

[1]  Hans-Jörg Kreowski,et al.  A Comparison Between Petri-Nets and Graph Grammars , 1980, WG.

[2]  Hartmut Ehrig,et al.  From Graph Grammars to High Level Replacement Systems , 1990, Graph-Grammars and Their Application to Computer Science.

[3]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[4]  Enrico Biermann,et al.  Independence Analysis of Firing and Rule-based Net Transformations in Reconfigurable Object Nets , 2008, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[5]  Frank Hermann,et al.  A Visual Editor for Reconfigurable Object Nets based on the ECLIPSE Graphical Editor Framework , 2007 .

[6]  Hartmut Ehrig,et al.  Algebraic high-level net transformation systems , 1995, Mathematical Structures in Computer Science.

[7]  Hartmut Ehrig,et al.  Transformations in Reconfigurable Place/Transition Systems , 2008, Concurrency, Graphs and Models.

[8]  Manfred Droste,et al.  From Petri Nets to Automata with Concurrency , 2002, Appl. Categorical Struct..

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

[10]  Hartmut Ehrig,et al.  Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation , 2006, Fundam. Informaticae.

[11]  Hartmut Ehrig,et al.  Petri Net Transformations , 2008 .

[12]  Hartmut Ehrig,et al.  Parallelism and concurrency in high-level replacement systems , 1991, Mathematical Structures in Computer Science.

[13]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[14]  Hartmut Ehrig,et al.  Low- and High-Level Petri Nets with Individual Tokens , 2010 .

[15]  H. Ehrig,et al.  On the relationship of model transformations based on triple and plain graph grammars , 2008, GRaMoT '08.

[16]  Hartmut Ehrig,et al.  Functors between M-adhesive Categories Applied to Petri Net and Graph Transformation Systems , 2011 .

[17]  Kathrin Hoffmann,et al.  Algebraic Higher-Order Nets: Graphs and Petri Nets as Tokens , 2002, WADT.

[18]  Hartmut Ehrig,et al.  Categorical Frameworks for Graph Transformation and HLR Systems Based on the DPO Approach , 2010, Bull. EATCS.

[19]  Hartmut Ehrig,et al.  From Algebraic Graph Transformation to Adhesive HLR Categories and Systems , 2007, CAI.