Petri Nets and Bisimulations

Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. The purpose of the present paper is twofold: firstly to present a central example of such a relationship (a coreflection between asynchronous transition systems and Petri nets), and secondly to illustrate its use by transferring to nets a general concept of bisimulation.

[1]  Grzegorz Rozenberg,et al.  Elementary Transition Systems , 1990, Theor. Comput. Sci..

[2]  Hans Hermes,et al.  Introduction to mathematical logic , 1973, Universitext.

[3]  Kim G. Larsen,et al.  Synthesizing Distinguishing Formulae for Real Time Systems , 1994, Nord. J. Comput..

[4]  A. Ingólfsdóttir.  A Semantic Theory for Value–Passing Processes Late Approach Part I: A Denotational Model and Its Complete Axiomatization , 1995 .

[5]  Mogens Nielsen,et al.  Bisimulations, Games, and Logic , 1994 .

[6]  Walter Vogler.  Deciding History Preserving Bisimilarity , 1991, ICALP.

[7]  Madhavan Mukund.  Petri Nets and Step Transition Systems , 1992, Int. J. Found. Comput. Sci..

[8]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

[9]  Madhavan Mukund,et al.  CCS, Location and Asynchronous Transition Systems , 1992, FSTTCS.

[10]  Kim G. Larsen,et al.  A Constraint Oriented Proof Methodology Based on Modal Transition Systems , 1994, TACAS.

[11]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[12]  Luca Aceto,et al.  A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version) , 1994 .

[13]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

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

[15]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[16]  M. W. Shields.  Concurrent Machines , 1985, Comput. J..

[17]  Sten Agerholm,et al.  A HOL Basis for Reasoning about Functional Programs , 1994 .

[18]  Rocco De Nicola,et al.  Observational equivalences for concurrency models , 1987, Formal Description of Programming Concepts.

[19]  Ilaria Castellani.  Bisimulations and Abstraction Homomorphisms , 1987, J. Comput. Syst. Sci..

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

[21]  Madhavan Mukund,et al.  CCS, Locations and Asynchronous Transition Systems , 1992 .

[22]  Peter Bro Miltersen,et al.  Dynamic Algorithms for the Dyck Languages , 1995, WADS.

[23]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

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

[25]  David B. Benson,et al.  Bisimulation of Automata , 1988, Inf. Comput..

[26]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[27]  Kim G. Larsen,et al.  From Timed Automata to Logic - and Back , 1995, MFCS.

[28]  Kim G. Larsen,et al.  Automatic Synthesis of Real Time Systems , 1994, ICALP.

[29]  Ernst-Rüdiger Olderog,et al.  Nets, terms and formulas , 1991 .

[30]  R. Labrecque.  The Correspondence Theory , 1978 .

[31]  Ieke Moerdijk,et al.  A Completeness Theorem for Open Maps , 1994, Ann. Pure Appl. Log..

[32]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .