On-the-Fly Exact Computation of Bisimilarity Distances

DOI10.1007/978-3-642-36742-7_1zbMath1381.68218OpenAlexW1515897776MaRDI QIDQ5326310

Giorgio Bacci, Radu Mardare, Giovanni Bacci, Kim Guldstrand Larsen

Publication date: 5 August 2013

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36742-7_1

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (13)

Converging from branching to linear metrics on Markov chains ⋮ Unnamed Item ⋮ A taxonomy for similarity metrics between Markov decision processes ⋮ Convex lattice equation systems ⋮ Approximate constrained lumping of polynomial differential equations ⋮ Unnamed Item ⋮ Asymmetric Distances for Approximate Differential Privacy ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ On the metric-based approximate minimization of Markov chains ⋮ Unnamed Item ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata ⋮ Unwinding biological systems

This page was built for publication: On-the-Fly Exact Computation of Bisimilarity Distances