A Uniform Approach to Petri Nets

The new concept of universal parameterized net classes is introduced in order to allow a uniform approach to different kinds of Petri net classes. By different actualizations of the net structure parameter and the data type parameter we obtain several well-known net classes, like elementary nets, place-transition nets, colored nets, predicate transition nets, and algebraic high-level nets, as well as several interesting new classes of low- and high-level nets. While the basic concept of parameterized net classes is defined on a purely set theoretical level the extended concept of universal parameterized net classes takes into account also morphisms and universal properties in the sense of category theory. This allows to discuss general constructions and compatibility results concerning union and fusion of nets for different types of net classes.

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

[2]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[3]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[4]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

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

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

[7]  Wolfgang Reisig,et al.  Petri Nets and Algebraic Specifications , 1991, Theor. Comput. Sci..

[8]  Wilfried Brauer,et al.  Net Theory and Applications , 1980, Lecture Notes in Computer Science.

[9]  Julia Padberg,et al.  Abstract Petri nets - uniform approach and rule-based refinement , 1996, Berichte aus der Informatik.

[10]  Hanna Klaudel,et al.  Communication as Unification in the Petri Box Calculus , 1995, FCT.

[11]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[12]  Kurt Jensen Informal Introduction to Coloured Petri Nets , 1992 .

[13]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[14]  Horst Herrlich,et al.  Abstract and concrete categories , 1990 .

[15]  Grzegorz Rozenberg,et al.  Petri Nets: Basic Notions, Structure, Behaviour , 1986, Current Trends in Concurrency.

[16]  Giancarlo Mauri,et al.  OBJSA Nets: a Class of High- level Nets Having Objects as Domains , 1987, European Workshop on Applications and Theory of Petri Nets.

[17]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

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

[19]  Hartmut Ehrig,et al.  On the Role of Category Theory in the Area of Algebraic Specification , 1995, COMPASS/ADT.

[20]  Kurt Jensen,et al.  Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[21]  Joseph A. Goguen,et al.  Introducing Institutions , 1983, Logic of Programs.

[22]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .