Complete axiomatization for the total variation distance of Markov chains

Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim G. and Mardare, Radu (2018) Complete axiomatization for the total variation distance of Markov chains. Electronic Notes in Theoretical Computer Science, 336. pp. 27-39. ISSN 1571-0661

[thumbnail of Bacci-etal-ENTCS-2018-Complete-axiomatization-for-the-total-variation-distance-of-Markov-chains]
Text (Bacci-etal-ENTCS-2018-Complete-axiomatization-for-the-total-variation-distance-of-Markov-chains)
Final Published Version
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo

Download (337kB)| Preview


    We propose a complete axiomatization for the total variation distance of finite labelled Markov chains. Our axiomatization is given in the form of a quantitative deduction system, a framework recently proposed by Mardare, Panangaden, and Plotkin (LICS 2016) to extend classical equational deduction systems by means of inferences of equality relations t≡εs indexed by rationals, expressing that “t is approximately equal to s up to an error ε”. Notably, the quantitative equational system is obtained by extending our previous axiomatization (CONCUR 2016) for the probabilistic bisimilarity distance with a distributivity axiom for the prefix operator over the probabilistic choice inspired by Rabinovich's (MFPS 1983). Finally, we propose a metric extension to the Kleene-style representation theorem for finite labelled Markov chains w.r.t. trace equivalence due to Silva and Sokolova (MFPS 2011).