Fractals everywhere
Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
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
Probabilistic Metric Semantics for a Simple Language with Recursion
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th 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
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
De Bakker-Zucker processes revisited
Information and Computation
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
Recursively defined metric spaces without contraction
Theoretical Computer Science
Characterize branching distance in terms of (η,α)-bisimilarity
Information and Computation
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
On metrics for probabilistic systems: Definitions and algorithms
Computers & Mathematics with Applications
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Timed, distributed, probabilistic, typed processes
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
The category-theoretic solution of recursive metric-space equations
Theoretical Computer Science
Fuzzy Prokhorov metric on the set of probability measures
Fuzzy Sets and Systems
Approximating Markovian testing equivalence
Theoretical Computer Science
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Value-passing CCS with noisy channels
Theoretical Computer Science
Approximating Markov processes through filtration
Theoretical Computer Science
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
Coalgebraic trace semantics for probabilistic transition systems based on measure theory
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.01 |
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 probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pseudometric is defined via the terminal coalgebra of a functor based on a metric on the space of Borel probability measures on a metric space. States of a probabilistic transition system have distance 0 if and only if they are probabilistic bisimilar. We also characterize our distance function in terms of a real-valued modal logic.