Abstract
| Original language | English |
|---|---|
| Journal | Logical Methods in Computer Science |
| ISSN | 1860-5974 |
| Publication status | Published - 2017 |
Fingerprint
Cite this
}
A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains. / Bacci, Giovanni; Bacci, Giorgio; Larsen, Kim Guldstrand; Mardare, Radu.
In: Logical Methods in Computer Science, 2017.Research output: Contribution to journal › Journal article › Research › peer-review
TY - JOUR
T1 - A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains
AU - Bacci, Giovanni
AU - Bacci, Giorgio
AU - Larsen, Kim Guldstrand
AU - Mardare, Radu
PY - 2017
Y1 - 2017
N2 - 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 =_epsilon s indexed by rationals, expressing that t is approximately equal to s up to an error epsilon. 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).
AB - 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 =_epsilon s indexed by rationals, expressing that t is approximately equal to s up to an error epsilon. 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).
M3 - Journal article
JO - Logical Methods in Computer Science
JF - Logical Methods in Computer Science
SN - 1860-5974
ER -