Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Observation equivalence as a testing equivalence
Theoretical Computer Science
Bisimulation through probabilistic testing
Information and Computation
Experimenting with process equivalence
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Towards Quantitative Verification of Probabilistic Transition Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
An Algorithm for Quantitative Verification of Probabilistic Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
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
Mathematical Structures in Computer Science
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
Tracing Relations Probabilistically
Fundamenta Informaticae
Tracing Relations Probabilistically
Fundamenta Informaticae
Recursively defined metric spaces without contraction
Theoretical Computer Science
Labelled Markov Processes: Stronger and Faster Approximations
Electronic Notes in Theoretical Computer Science (ENTCS)
An intrinsic characterization of approximate probabilistic bisimilarity
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Testing probabilistic equivalence through reinforcement learning
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Tracing Relations Probabilistically
Fundamenta Informaticae
Tracing Relations Probabilistically
Fundamenta Informaticae
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
| Hi-index | 0.00 |
Larsen and Skou introduced a notion of bisimulation for probabilistic transition systems. They characterized probabilistic bisimilarity in terms of a probabilistic modal logic and also in terms of 'button pressing' tests. Desharnais et al. extended the notion of probabilistic bisimulation and the logical characterization of probabilistic bisimilarity to labelled Markov processes. These processes generalize probabilistic transition systems in that they also allow continuous state spaces. We extend the characterization of probabilistic bisimilarity in terms of testing to labelled Markov processes. One of our main technical contributions is the construction of a final object in a category of labelled Markov processes and the identification of a natural metric on the state space of the final labelled Markov process. This metric provides us with another characterization of probabilistic bisimilarity: states are probabilistic bisimilar if and only if they have distance 0.