Bisimulation and open maps

  title={Bisimulation and open maps},
  author={Andr{\'e} Joyal and Mogens Nielsen and Glynn Winskel},
An abstract deenition of bisimulation is presented. It enables a uniform deenition of bisimulation across a range of diierent 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 deenition readily specialises to Milner's strong bisimulation. On event structures it explains and leads to a… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-8 of 8 references

Models for concur- rency. To appear as a chapter in the Handbook of Logic in Computer Science, Oxford Univer- sity Press. A draft appears as Aarhus

G. Winskel, M. Nielsen
DAIMI PB 429, • 1992
View 3 Excerpts
Highly Influenced

Behaviour structures and nets

A. Rabinovitch, B. Traktenbrot
Fundamenta Informatica, • 1988
View 2 Excerpts

Bisimulation of Automata

Inf. Comput. • 1988
View 2 Excerpts

Correspondence theory. In the Handbook of Philosophical Logic, Vol.II, ed

J. Van Bentham
Gab- bay and Guenther, Reidel, • 1984
View 1 Excerpt

Categories for the Working Math- ematician

S. MacLane
Graduate Texts in Mathematics, • 1971
View 1 Excerpt

Decidability of S4.1

K. Segerberg
Theoria 34, • 1968
View 1 Excerpt

Similar Papers

Loading similar papers…