Deciding probabilistic bisimilarity distance one for labelled Markov chains

DOI10.1007/978-3-319-96145-3_39zbMath1511.68187OpenAlexW2883844381MaRDI QIDQ6041138

Franck Van Breugel, Qiyi Tang

Publication date: 26 May 2023

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-96145-3_39

zbMATH Keywords

probabilistic bisimilarityprobabilistic bisimilarity distancelabelled Markov chain

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata

This page was built for publication: Deciding probabilistic bisimilarity distance one for labelled Markov chains