Bisimulation from Open Maps

An abstract definition of bisimulation is presented. It makes possible a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction from Petri nets), and labelled event structures are considered. On transition systems the abstract definition readily specialises to Milner's strong bisimulation. On event structures it explains and leads to a strengthening of the history-preserving bisimulation of Rabinovitch and Traktenbrot and van Glabeek and Goltz. A tie-up with open maps in a (pre)topos, as they appear in the work of Joyal and Moerdijk, brings to light a new model, presheaves on categories of pomsets, into which the usual category of labelled event structures embeds fully and faithfully. As an indication of its promise, this new presheaf model has “refinement” operators. The general approach yields a logic, generalising Hennessy?Milner logic, which is characteristic for the generalised notion of bisimulation.

[1]  Peter D. Mosses,et al.  Unified Algebras and Abstract Syntax , 1992, COMPASS/ADT.

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

[3]  Glynn Winskel,et al.  Presheaf Models for Concurrency , 1996, CSL.

[4]  Glynn Winskel.  Semantics, Algorithmics and Logic: Basic Research in Computer Science. BRICS Inaugural Talk , 1994 .

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

[6]  Glynn Winskel,et al.  Petri Nets and Bisimulations , 1994 .

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

[8]  Alexander E. Andreev.  Complexity of Nondeterministic Functions , 1994 .

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

[10]  Oswald Wyler,et al.  Lecture notes on Topoi and Quasitopoi , 1991 .

[11]  Glynn Winskel,et al.  Linear Logic on Petri Nets , 1993, REX School/Symposium.

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

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

[14]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[15]  Nils Klarlund,et al.  Graphs and Decidable Transductions based on Edge Constraints , 1994 .

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

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

[18]  Michael Barr,et al.  Category theory for computer science , 1995 .

[19]  I. Moerdijk,et al.  Sheaves in geometry and logic: a first introduction to topos theory , 1992 .

[20]  H. Cheng.  Calculus of Communicating Systems : a synopsis Mantis , 1994 .

[21]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994 .

[22]  Ilaria Castellani.  Bisimulations and Abstraction Homomorphisms , 1985, TAPSOFT, Vol.1.