A new, more stable notion of bisimilarity for labelled Markov chains is defined, proven to ensure continuity of the probabilistic bisimilarity distance, and computable in polynomial time.
Logical Methods in Computer Science6(3) (2010)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Robust Probabilistic Bisimilarity for Labelled Markov Chains
A new, more stable notion of bisimilarity for labelled Markov chains is defined, proven to ensure continuity of the probabilistic bisimilarity distance, and computable in polynomial time.