Bisimulation through probabilistic testing
Information and Computation
Structured operational semantics and bisimulation as a congruence
Information and Computation
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Fixpoint semantics and simulation
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Category Theory and Computer Science
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Non-strongly stable orders also define interesting simulation relations
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Finitary functors: from set to preord and poset
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Relation liftings on preorders and posets
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Preorders on monads and coalgebraic simulations
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by our theory include bisimilarity, similarity, upper and lower similarity for transition systems with divergence, similarity for discrete probabilistic systems, and nested similarity. Our results describe firstly how to characterize the relation in terms of a given final coalgebra, and secondly how to construct a final coalgebra using the relation. Our theory uses a notion of "relator" based on earlier work of Thijs. But whereas a relator must preserve binary composition in Thijs' framework, it only laxly preserves composition in ours. It is this weaker requirement that allows nested similarity to be an example.