On-the-fly computation of bisimilarity distances

Tools

Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim G. and Mardare, Radu (2017) On-the-fly computation of bisimilarity distances. Logical Methods in Computer Science, 13 (2). pp. 1-25. 13. ISSN 1860-5974 (https://doi.org/10.23638/LMCS-13(2:13)2017)

[thumbnail of Bacci-etal-LMCS-2017-On-the-fly-computation-of-bisimilarity-distances]
Preview
 Text. Filename: Bacci_etal_LMCS_2017_On_the_fly_computation_of_bisimilarity_distances.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (334kB)| Preview

Abstract

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 Desharnais et al. between discrete-time Markov chains as an optimal solution of a linear program that can be solved by using the ellipsoid method. Inspired by their result, we propose a novel linear program characterization to compute the distance in the continuoustime setting. Differently from previous proposals, ours has a number of constraints that is bounded by a polynomial in the size of the CTMC. This, in particular, proves that the distance we propose can be computed in polynomial time. Despite its theoretical importance, the proposed linear program characterization turns out to be inefficient in practice. Nevertheless, driven by the encouraging results of our previous work presented at TACAS’13, we propose an efficient on-the-fly algorithm, which, unlike the other mentioned solutions, computes the distances between two given states avoiding an exhaustive exploration of the state space. This technique works by successively refining over-approximations of the target distances using a greedy strategy, which ensures that the state space is further explored only when the current approximations are improved. Tests performed on a consistent set of (pseudo)randomly generated CTMCs show that our algorithm improves, on average, the efficiency of the corresponding iterative and linear program methods with orders of magnitude.

CORE (COnnecting REpositories)