A survey of behaviour and equivalence preserving refinements of Petri nets

Results on refinements of places and transitions in Petri nets are surveyed. Such refinements may either transform a net to a refined net with the same behaviour, where behaviour often means safeness or liveness. Or they may transform semantically equivalent nets to refined nets which are semantically equivalent again. Here the semantics of a net is a description of the possible runs incorporating information on choices to a varying degree.

[1]  Walter Vogler,et al.  Bisimulation and Action Refinement , 1991, Theor. Comput. Sci..

[2]  Astrid Kiehn,et al.  Petri Net systems and their closure properties , 1988, European Workshop on Applications and Theory in Petri Nets.

[3]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[4]  Ichiro Suzuki,et al.  A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..

[5]  Walter Vogler,et al.  Behaviour Preserving Refinement of Petri Nets , 1986, WG.

[6]  Luca Aceto,et al.  Full Abstraction for Series-Parallel Pomsets , 1991, TAPSOFT, Vol.1.

[7]  Bernd Baumgarten,et al.  On Internal and External Characterizations of PT- net Building Block Behaviors , 1988, European Workshop on Applications and Theory of Petri Nets.

[8]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[9]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[10]  Kim S. Larsen,et al.  Fully abstract models for a process language with refinement , 1988, REX Workshop.

[11]  A. W. Roscoe,et al.  An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.

[12]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[13]  Klaus Müller.  Constructable Petri Nets , 1985, J. Inf. Process. Cybern..

[14]  Carla Simone,et al.  A state transformation preorder over a class of EN systems , 1991, Applications and Theory of Petri Nets.

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

[16]  Walter Vogler.  Failures Semantics Based on Interval Semiwords is a Congruence for Refinement , 1990, STACS.

[17]  Robert Valette,et al.  Analysis of Petri Nets by Stepwise Refinements , 1979, J. Comput. Syst. Sci..

[18]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[19]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[20]  Giorgio De Michelis,et al.  Concurrency versus interleaving: an instructuve example , 1987, Bull. EATCS.

[21]  R. J. vanGlabbeek.  The refinement theorem for ST-bisimulation semantics , 1990 .

[22]  P. Fishburn.  Intransitive indifference with unequal indifference intervals , 1970 .

[23]  Hartmann J. Genrich,et al.  A Dictionary of Some Basic Notions of Net Theory , 1979, Advanced Course: Net Theory and Applications.

[24]  Ugo Montanari,et al.  Axiomatizing net computations and processes , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[25]  José Meseguer,et al.  Petri nets are monoids: a new algebraic foundation for net theory , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[26]  Ilaria Castellani,et al.  On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[27]  G. Rozenberg,et al.  Elementary transition systems , 1990 .

[28]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[29]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[30]  J.J.C. Meijer,et al.  Refinement in branching time semantics , 1989 .

[31]  Rocco De Nicola,et al.  Partial orderings descriptions and observations of nondeterministic concurrent processes , 1988, REX Workshop.

[32]  Matthew Hennessy,et al.  Axiomatising Finite Concurrent Processes , 1988, SIAM J. Comput..

[33]  Antoni W. Mazurkiewicz,et al.  Traces, Histories, Graphs: Instances of a Process Monoid , 1984, International Symposium on Mathematical Foundations of Computer Science.

[34]  Raymond R. Devillers,et al.  On the Definition of a Bisimulation Notion Based on Partial Words , 1988 .

[35]  Jörg Desel,et al.  P/T-systems as abstractions of C/E-systems , 1990, European Workshop on Applications and Theory in Petri Nets.

[36]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[37]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..