Computing Probabilistic Bisimilarity Distances for Probabilistic Automata

The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic automata. In this paper, we present a characterization of the bisimilarity distance as the solution of a simple sto...

ver descrição completa

Detalhes bibliográficos
Principais autores: Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel
Formato: Artigo
Idioma:English
Publicado em: Logical Methods in Computer Science e.V. 2021-02-01
coleção:Logical Methods in Computer Science
Assuntos:
Acesso em linha:https://lmcs.episciences.org/5994/pdf