Projects per year
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 =_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).
Original language  English 

Journal  Logical Methods in Computer Science 
ISSN  18605974 
Publication status  Published  2017 
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.
Projects
 5 Finished


DiCyPS: Center for DataIntensive CyberPhysical Systems
Larsen, K. G., Skou, A., Pedersen, T. B., Jensen, C. S., Kjeldskov, J., Skov, M. B., Nielsen, B., Lahrmann, H., BakJensen, B., Guerrero, J. M. & Raptis, D.
01/01/2015 → 31/12/2020
Project: Research

CASSTING: Collective Adaptive System SynThesIs using Nonzerosum Games
Larsen, K. G., Skou, A., David, A. & Srba, J.
01/04/2013 → 31/03/2016
Project: Research