Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs

DOI10.1007/978-3-319-69483-2_2zbMath1498.68187OpenAlexW2765125579MaRDI QIDQ5045376

Andrea Turrini, Vahid Hashemi, Ernst Moritz Hahn, Holger Hermanns, Khaled M. Elbassioni

Publication date: 4 November 2022

Published in: Dependable Software Engineering. Theories, Tools, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-69483-2_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Markov and semi-Markov decision processes (90C40) 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 (2)

Lumpability for uncertain continuous-time Markov chains ⋮ Equivalence checking 40 years after: a review of bisimulation tools

This page was built for publication: Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs