Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

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;]
Published on June 30, 2017
Volume 13, Issue 2

A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains

Giorgio Bacci ; Giovanni Bacci ; Kim G. Larsen ; Radu Mardare.
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al. for the class of finite labelled Markov chains. Our axiomatization is given in the style of a quantitative extension of equational logic recently proposed by Mardare, Panangaden, and Plotkin (LICS&nbsp;[&hellip;]
Published on November 16, 2018
Volume 14, Issue 4
  • < Previous
  • 1
  • Next >