A complete quantitative deduction system for the bisimilarity distance on markov chains

Research output: Contribution to journalJournal articleResearchpeer-review

8 Citations (Scopus)

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 ≡ ε s indexed by rationals, expressing that “t is approximately equal to s up to an error ε”. 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).

Original languageEnglish
Article number15
JournalLogical Methods in Computer Science
Volume14
Issue number4
ISSN1860-5974
DOIs
Publication statusPublished - 2018

Bibliographical note

Funding Information:
Work supported by the EU 7th Framework Programme (FP7/2007-13) under Grants Agreement nr.318490 (SENSATION), nr.601148 (CASSTING), the Sino-Danish Basic Research Center IDEA4CPS funded by Danish National Research Foundation and National Science Foundation China, the ASAP Project (4181-00360) funded by the Danish Council for Independent Research, the ERC Advanced Grant LASSO, and the Innovation Fund Denmark center DiCyPS.

Publisher Copyright:
© G. Bacci, G. Bacci, K. G. Larsen, and R. Mardare.

Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.

Keywords

  • Axiomatization
  • Behavioral distances
  • Markov chains

Fingerprint

Dive into the research topics of 'A complete quantitative deduction system for the bisimilarity distance on markov chains'. Together they form a unique fingerprint.

Cite this