Let be a set equipped with a binary relation . Then a bisimulation is a binary relation on such that for all with , the following conditions hold:
for all such that , there exists a such that and
for all such that , there exists a such that and
For labelled transition systems, Walker 1994 gives a definition equivalent to the following:
On a system with points and transition relations , a bisimulation is a symmetric relation such that whenever , and , then with .
The union of all bisimulation relations, as subsets of , is a relation called bisimilarity.
Let be the set of all possible (finite or infinite) transition sequences starting as . Trace equivalence, defined as if and only if , is a bisimulation.
In Joyal-Nielsen-Winskel (p.13) is given the following definition. For what a “path category in a category of models” is, see there.
Let be a path category in a category of models . Two objects are called to be -bisimilar if there is a span of -open maps .
The relation of -open maps and open maps is given by Proposition 11, p.32:
If is a dense full subcategory of , then -is -open iff is an open map.
Wikipedia (English), Bisimulation
Peter Aczel, Non-Well-Founded Sets, especially Chapter 4.
Davide Sangiorgi, On the Origins of Bisimulation and Coinduction
André Joyal, Mogens Nielsen, Glynn Winskel, Bisimulation from open maps, pdf
Bard Bloom, Sorin Istrail, Albert Meyer, Bisimulation can’t be traced, pdf
Yde Venema, Algebras and Coalgebras, §6 (p.332-426).11(p.398-403) in Blackburn, van Benthem, Wolter, Handbook of modal logic, Elsevier, 2007.
Pedro Resende, Quantales, finite observations and strong bisimulation, Theor. Comp. Sci. 254:1–2 (2001) 95–149, doi
David Walker, On Bisimulation in the -calculus, CONCUR ‘94: Concurrency Theory (1994).
Last revised on February 15, 2024 at 10:07:37. See the history of this page for a list of all contributions to it.