The bisimdist library: Efficient computation of bisimilarity distances for markovian models (original) (raw)

Abstract

ABSTRACT This paper presents a library for exactly computing the bisimilarity Kantorovich-based pseudometrics between Markov chains and between Markov decision processes. These are distances that measure the behavioral discrepancies between non-bisimilar systems. They are computed by using an on-the-fly greedy strategy that prevents the exhaustive state space exploration and does not require a complete storage of the data structures. Tests performed on a consistent set of (pseudo)randomly generated instances show that our algorithm improves the efficiency of the previously proposed iterative algorithms, on average, with orders of magnitude. The tool is available as a Mathematica package library.

Giorgio Bacci hasn't uploaded this paper.

Let Giorgio know you want this paper to be uploaded.

Ask for this paper to be uploaded.