Bisimulation through probabilistic testing
Information and Computation
A fixed-point theorem in a category of compact metric spaces
Theoretical Computer Science
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Quantitative Analysis and Model Checking
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
Mathematical Structures in Computer Science
Security Analysis of a Probabilistic Non-repudiation Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Testing Labelled Markov Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Probabilistic Information Flow in a Process Algebra
CONCUR '01 Proceedings of the 12th 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
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Information flow in interactive systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative information flow in interactive systems
Journal of Computer Security - ARSPA-WITS'10
| Hi-index | 0.00 |
It has been argued that Boolean-valued logics and associated discrete notions of behavioural equivalence sit uneasily with semantic models featuring quantitative data, like probabilistic transition systems. In this paper we present a pseudometric on a class of reactive probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pseudometric is defined via the terminal coalgebra of a functor based on the Hutchinson metric on the space of Borel probability measures on a metric space. We also characterize the distance between systems in terms of a real-valued modal logic.