Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
A strongly polynomial minimum cost circulation algorithm
Combinatorica
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Labelled markov processes
Mathematical Structures in Computer Science
Approximate Reasoning for Real-Time Probabilistic Processes
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
An approximation algorithm for labelled Markov processes: towards realistic approximation
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The Kantorovich Metric in Computer Science: A Brief Survey
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
Time for verification
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Quantitative Kleene coalgebras
Information and Computation
A unifying formal basis for the SENSORIA approach: a white paper
Rigorous software engineering for service-oriented systems
Theoretical Computer Science
Testing probabilistic equivalence through reinforcement learning
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
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
On-the-Fly exact computation of bisimilarity distances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The bisimdist library: efficient computation of bisimilarity distances for markovian models
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Quantitative reactive modeling and verification
Computer Science - Research and Development
Approximating Bisimilarity for Markov Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
In an earlier paper we presented a pseudometric on the states of a probabilistic transition system, yielding a quantitative notion of behavioural equivalence. The behavioural pseudometric was defined via the terminal coalgebra of a functor based on a metric on Borel probability measures. In the present paper we give a polynomial-time algorithm, based on linear programming, to calculate the distances between states up to a prescribed degree of accuracy.