Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Handbook of logic in computer science (vol. 4)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Towards a unified view of bisimulation: a comparative study
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency
Coalgebra morphisms subsume open maps
Theoretical Computer Science
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Convenient Category of Processes and Simulations 1: Modulo Strong Bisimilarity
CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Unique factorisation lifting functors and categories of linearly-controlled processes
Mathematical Structures in Computer Science
Observational trees as models for concurrency
Mathematical Structures in Computer Science
Hi-index | 0.00 |
We study the functorial characterisation of bisimulation-based equivalences over a categorical model of labelled trees. We show that in a setting where all labels are visible, strong bisimilarity can be characterised in terms of enriched functors by relying on the reflection of paths with their factorisations. For an enriched functor F, this notion requires that a path (an internal morphism in our framework) π going from F(A) to C corresponds to a path p going from A to K, with F(K) = C, such that every possible factorisation of π can be lifted in an appropriate factorisation of p. This last property corresponds to a Conduché property for enriched functors, and a very rigid formulation of it has been used by Lawvere to characterise the determinacy of physical systems. We also consider the setting where some labels are not visible, and provide characterisations for weak and branching bisimilarity. Both equivalences are still characterised in terms of enriched functors that reflect paths with their factorisations: for branching bisimilarity, the property is the same as the one used to characterise strong bisimilarity when all labels are visible; for weak bisimilarity, a weaker form of path factorisation lifting is needed. This fact can be seen as evidence that strong and branching bisimilarity are strictly related and that, unlike weak bisimilarity, they preserve process determinacy in the sense of Milner.