This entry is about
Definition (p.13): 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 .
Theorem (p.14): Two transition systems (and so synchronisation trees), over the same labelling set , are -bisimilar iff they are strongly bisimilar.
Definition (p.35): A path bisimulation wrt. , between objects of is defined to be a set of pairs of paths with common domain such that
(1) Initial paths are related: If are initial paths, then .
(2a) If and if , with , then there is a such that and .
(2b) The symmetric condition to (2a).
A path bisimulation is called to be strong if additionally (3) is satisfied.
(3) with , and in , then .
Lemma (p.37): If are -bisimilar, then , are strong path bisimilar wrt. .
Created on February 18, 2013 at 05:10:30. See the history of this page for a list of all contributions to it.