A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Bisimulation through probabilistic testing
Information and Computation
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
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
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
Testing Labelled Markov Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Approximate abstraction of stochastic hybrid automata
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
On behavioural pseudometrics and closure ordinals
Information Processing Letters
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Taking it to the limit: approximate reasoning for markov processes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
| Hi-index | 0.00 |
In an earlier paper we presented a pseudometric on the 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 probability measures. In the present paper we give an algorithm, based on linear programming, to calculate the distance between two states up to prescribed degree of accuracy.