English

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

Logic in Computer Science 2023-06-22 v5

Abstract

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 2016) that uses equality relations tεst \equiv_\varepsilon s indexed by rationals, expressing that `tt is approximately equal to ss up to an error ε\varepsilon'. Notably, our quantitative deduction system extends in a natural way the equational system for probabilistic bisimilarity given by Stark and Smolka by introducing an axiom for dealing with the Kantorovich distance between probability distributions. The axiomatization is then used to propose a metric extension of a Kleene's style representation theorem for finite labelled Markov chains, that was proposed (in a more general coalgebraic fashion) by Silva et al. (Inf. Comput. 2011).

Cite

@article{arxiv.1702.02528,
  title  = {A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains},
  author = {Giorgio Bacci and Giovanni Bacci and Kim G. Larsen and Radu Mardare},
  journal= {arXiv preprint arXiv:1702.02528},
  year   = {2023}
}

Comments

Logical Methods in Computer Science

R2 v1 2026-06-22T18:13:00.735Z