Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation

The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavior of Algebraic High-Level nets, a high-level Petri net variant, by a parallel, typed, attributed graph transformation system. Such a general parallel transformation system for AHL nets replaces the translation of transitions of specific AHL nets. After reviewing the formal definitions of AHL nets and parallel attributed graph transformation, we formalize the classical translation from AHL nets to graph transformation systems and prove the correctness of the translation. The translation approach then is contrasted to a definition for AHL net behavior based on parallel graph transformation. We show that the resulting amalgamated rules correspond to the behavior rules from the classical translation approach.

[1]  Johan Lilius,et al.  On the Structure of High-level Nets , 1995 .

[2]  Ugo Montanari,et al.  A model for distributed systems based on graph rewriting , 1987, JACM.

[3]  Hartmut Ehrig,et al.  Mathematisch-strukturelle Grundlagen der Informatik , 1999, Mathematisch-strukturelle Grundlagen der Informatik.

[4]  Manfred Nagl,et al.  Applications of Graph Transformations with Industrial Relevance , 2004, Lecture Notes in Computer Science.

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

[6]  S. Lane.  Categories for the Working Mathematician , 1971 .

[7]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[8]  Günter Hommel,et al.  Quality of Communication-Based Systems , 1995 .

[9]  Hartmut Ehrig,et al.  From Parallel Graph Grammars to Parallel High-Level Replacement Systems , 1992 .

[10]  Samuil Angelov,et al.  Petri Net Technology for Communication-Based Systems , 2003, Lecture Notes in Computer Science.

[11]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[12]  Hartmut Ehrig,et al.  Fundamental Theory for Typed Attributed Graph Transformation , 2004, ICGT.

[13]  Claudia Ermel,et al.  GenGED - A Visual Definition Tool for Visual Modeling Environments , 2003, AGTIVE.

[14]  Paul Grefen,et al.  A Three-Level Process Framework for Contract-Based Dynamic Service Outsourcing , 2003 .

[15]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[16]  Claudia Ermel,et al.  Scenario animation for visual behavior models: A generic approach , 2003, Software & Systems Modeling.

[17]  Grzegorz Rozenberg,et al.  Automata, languages, development , 1976 .

[18]  Juan de Lara,et al.  Parallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets , 2004, GT-VMT@ETAPS.

[19]  Hartmut Noltemeier,et al.  Graphtheoretic Concepts in Computer Science , 1980, Lecture Notes in Computer Science.

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

[21]  Claudia Ermel,et al.  Formal Relationship between Petri Nets and Graph Grammars as Basis for Animation Views in GenGED , 2002 .

[22]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1: Equations and Initial Semantics , 1985 .

[23]  Ugo Montanari,et al.  Specification of Concurrent Systems: from Petri Nets to Graph Grammars , 1995 .

[24]  Gabriele Taentzer,et al.  Parallel and distributed graph transformation - formal description and application to communication-based systems , 1996, Berichte aus der Informatik.