Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Forward and backward simulations I.: untimed systems
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Theoretical Computer Science - Selected papers of CMCS'03
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Comparative branching-time semantics for Markov chains
Information and Computation
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Jonsson and Larsen's notion of probabilistic simulation is studied from a coalgebraic perspective. The notion is compared with two generic coalgebraic definitions of simulation: Hughes and Jacobs' one, and the one introduced previously by the author. We show that the first almost coincides with the second, and that the second is a special case of the last. We investigate implications of this characterization; notably the Jonsson-Larsen simulation is shown to be sound, i.e. its existence implies trace inclusion.