Bisimulation through probabilistic testing
Information and Computation
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in 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
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Labelled Markov Processes: Stronger and Faster Approximations
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Approximating labelled Markov processes
Information and Computation
Semi-pullbacks and bisimulation in categories of Markov processes
Mathematical Structures in Computer Science
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
Semi-pullbacks and bisimulations in categories of stochastic relations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Approximating Markov Processes by Averaging
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Approximating labelled Markov processes again!
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
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
A logical duality for underspecified probabilistic systems
Information and Computation
Automatica (Journal of IFAC)
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
Unprovability of the logical characterization of bisimulation
Information and Computation
Similarity quotients as final coalgebras
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Bisimulations for non-deterministic labelled markov processes
Mathematical Structures in Computer Science
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Measurable stochastics for Brane Calculus
Theoretical Computer Science
Approximating Markov processes through filtration
Theoretical Computer Science
Dexter kozen's influence on the theory of labelled markov processes
Logic and Program Semantics
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
Approximating Bisimilarity for Markov Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Stone Duality for Markov Processes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Measurable Spaces and Their Effect Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulation, originally due to Larsen and Skou. Event bisimulation uses a sub @s-algebra as the basic carrier of information rather than an equivalence relation. The resulting notion is thus based on measurable subsets rather than on points: hence the name. Event bisimulation applies smoothly for general measure spaces; bisimulation, on the other hand, is known only to work satisfactorily for analytic spaces. We prove the logical characterization theorem for event bisimulation without having to invoke any of the subtle aspects of analytic spaces that feature prominently in the corresponding proof for ordinary bisimulation. These complexities only arise when we show that on analytic spaces the two concepts coincide. We show that the concept of event bisimulation arises naturally from taking the co-congruence point of view for probabilistic systems. We show that the theory can be given a pleasing categorical treatment in line with general coalgebraic principles. As an easy application of these ideas we develop a notion of ''almost sure'' bisimulation; the theory comes almost ''for free'' once we modify Giry's monad appropriately.