Rule-Based Refinement of Petri Nets: A Survey

This contribution provides a thorough survey of our work on rule-based refinement. Rule-based refinement comprises the transformation of Petri nets using rules while preserving certain system properties. Petri net rules and transformations are expressed by morphisms and pushouts. This allows an abstract formulation of our notions independent of a specific Petri net class, as place/transition nets, elementary nets, predicate/transition nets etc. Hence, it is adequate to consider our approach as rule-based refinement of Petri nets in general. We have presented various results in recent years at different conferences. So this contribution gives an overview of our work in a compact form leaving out the technical details.

[1]  Sibylle Peuker,et al.  Halbordnungsbasierte Verfeinerung zur Verifikation verteilter Algorithmen , 2001 .

[2]  F. Joel,et al.  Reduction Method Of Coloured Petri Nets , 1988, Proceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics.

[3]  Grzegorz Rozenberg.  Advances in Petri Nets 1987 , 1986, Lecture Notes in Computer Science.

[4]  Hartmann J. Genrich.  Predicate/transition nets , 1987 .

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

[6]  Claudia Ermel,et al.  Rule-based refinement of high-level nets preserving safety properties , 2001, Sci. Comput. Program..

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

[8]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

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

[10]  Herbert Weber,et al.  Improving the Usability of Petri Nets with the »Petri Net Baukasten« , 2001, Unifying Petri Nets.

[11]  Maike GajewskyBericht,et al.  Safety Preserving Transformations of Coloured Petri Nets Safety Preserving Transformations of Coloured Petri Nets ? , 2000 .

[12]  Ursula Goltz,et al.  Equivalences and Refinement , 1990, Semantics of Systems of Concurrent Processes.

[13]  Irène Guessarian.  Semantics of Systems of Concurrent Processes , 1990, Lecture Notes in Computer Science.

[14]  Claudia Ermel,et al.  Requirements engineering of a medical information system using rule-based refinement of Petri nets , 1996 .

[15]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.

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

[17]  Wil M. P. van der Aalst,et al.  Verification Of Workflow Task Structures: A Petri-net-baset Approach , 2000, Inf. Syst..

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

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

[20]  Younes Souissi,et al.  Deterministic Systems of Sequential Processes: a class of structured Petri nets , 1991, Applications and Theory of Petri Nets.

[21]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[22]  Julia Padberg,et al.  Stepwise Introduction and Preservation of Safety Properties in Algebraic High-Level Net Systems , 2000, FASE.

[23]  Julia Padberg,et al.  Categorical Approach to Horizontal Structuring and Refinement of High-Level Replacement Systems , 1999, Appl. Categorical Struct..

[24]  Sibylle Peuker.  Concurrency Based Transition Refinement for the Verification of Distributed Algorithms , 2003, Petri Net Technology for Communication-Based Systems.

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

[26]  Javier Esparza.  Model Checking Using Net Unfoldings , 1994, Sci. Comput. Program..

[27]  Jörg Becker,et al.  Colloquium on Petri Net Technologies for Modeling Communication Based Systems , 1999 .

[28]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[29]  Hartmut Ehrig,et al.  The Petri Net Baukasten of the DFG Forschergruppe PETRI NET TECHNOLOGY , 2003, Petri Net Technology for Communication-Based Systems.

[30]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1988, Theor. Comput. Sci..

[31]  Joël Favrel,et al.  Hierarchical reduction method for analysis and decomposition of Petri nets , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

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

[33]  Julia Padberg,et al.  Rule-Based Refinement of Petri Nets for Modeling Train Control Systems , 2000 .

[34]  Bernhard Josko,et al.  Modular Verification of Petri Nets: The Temporal Logic Approach , 1989, REX Workshop.

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

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

[37]  Manuel Silva Suárez,et al.  On the analysis and synthesis of free choice systems , 1991, Applications and Theory of Petri Nets.

[38]  Colin Stirling,et al.  Verifying Temporal Properties of Processes , 1990, CONCUR.

[39]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[40]  Grzegorz Rozenberg,et al.  High-level Petri Nets: Theory And Application , 1991 .

[41]  Grzegorz Rozenberg.  Advances in Petri Nets 1992 , 1992, Lecture Notes in Computer Science.

[42]  J. Padberg,et al.  Preserving Liveness with Rule-Based Refinement of Place/Tr ansition Systems , 2002 .

[43]  Kurt Jensen,et al.  Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.

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

[45]  Maike Gajewsky.  Concepts and Requirements for Transformations within Petri Net Based Process Models , 2000 .

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

[47]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 3, Practical Use , 1997 .

[48]  Peter Huber,et al.  Design/CPN?: A Reference Manual , 1992 .

[49]  Francesco Parisi-Presicce,et al.  On the Compatibility of Model and Model-Class Transformations , 2001, WADT.

[50]  Gianfranco Balbo,et al.  Application and Theory of Petri Nets 1997 , 1997 .

[51]  Hartmut Ehrig,et al.  Unifying Petri Nets , 2001, Lecture Notes in Computer Science.

[52]  Jörg Desel,et al.  Vicinity respecting net morphisms , 1991, Applications and Theory of Petri Nets.

[53]  Grzegorz Rozenberg.  Advances in Petri Nets 1990 , 1989, Lecture Notes in Computer Science.