License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2016.21
URN: urn:nbn:de:0030-drops-61569
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6156/
Go to the corresponding LIPIcs Volume Portal


Bacci, Giorgio ; Bacci, Giovanni ; G. Larsen, Kim ; Mardare, Radu

Complete Axiomatization for the Bisimilarity Distance on Markov Chains

pdf-format:
LIPIcs-CONCUR-2016-21.pdf (0.6 MB)


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'16) that uses equality relations t =_e s indexed by rationals, expressing that "t is approximately equal to s up to an error e". Notably, our quantitative deductive 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.

BibTeX - Entry

@InProceedings{bacci_et_al:LIPIcs:2016:6156,
  author =	{Giorgio Bacci and Giovanni Bacci and Kim G. Larsen and Radu Mardare},
  title =	{{Complete Axiomatization for the Bisimilarity Distance on Markov Chains}},
  booktitle =	{27th International Conference on Concurrency Theory (CONCUR 2016)},
  pages =	{21:1--21:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-017-0},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{59},
  editor =	{Jos{\'e}e Desharnais and Radha Jagadeesan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6156},
  URN =		{urn:nbn:de:0030-drops-61569},
  doi =		{10.4230/LIPIcs.CONCUR.2016.21},
  annote =	{Keywords: Markov chains, Behavioral distances, Axiomatization}
}

Keywords: Markov chains, Behavioral distances, Axiomatization
Collection: 27th International Conference on Concurrency Theory (CONCUR 2016)
Issue Date: 2016
Date of publication: 24.08.2016


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI