Search

• < Previous
• 1
• Next >

---

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata

Giorgio Bacci ; Giovanni Bacci ; Kim G. Larsen ; Radu Mardare ; Qiyi Tang ; Franck van Breugel.

The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic automata. In this paper, we present a characterization of the bisimilarity distance as the solution of a simple&nbsp;[&hellip;]

---

On-the-Fly Computation of Bisimilarity Distances

Giorgio Bacci ; Giovanni Bacci ; Kim G. Larsen ; Radu Mardare.

We propose a distance between continuous-time Markov chains (CTMCs) and study the problem of computing it by comparing three different algorithmic methodologies: iterative, linear program, and on-the-fly. In a work presented at FoSSaCS'12, Chen et al. characterized the bisimilarity distance of&nbsp;[&hellip;]

---