Polynomial-time alternating probabilistic bisimulation for interval MDPs

DOI10.1007/978-3-319-69483-2_2MaRDI QIDQ5045376zbMATH OpenOpenAlexFDO

Authors Vahid Hashemi, Andrea Turrini, Ernst Moritz Hahn, Holger Hermanns, Khaled 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) 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) Markov and semi-Markov decision processes (90C40)

Recommendations

• Compositional bisimulation minimization for interval Markov decision processes
• Probabilistic bisimulations for PCTL model checking of interval MDPs
• Exploiting robust optimization for interval probabilistic bisimulation
• Multi-objective Robust Strategy Synthesis for Interval Markov Decision Processes
• Decision Problems for Interval Markov Chains

Cited in

(8)

• Exploiting robust optimization for interval probabilistic bisimulation
• Compositional bisimulation minimization for interval Markov decision processes
• Probabilistic bisimulations for PCTL model checking of interval MDPs
• Alternating good-for-MDPs automata
• Equivalence checking 40 years after: a review of bisimulation tools
• Interval Markov decision processes with multiple objectives: from robust strategies to Pareto curves
• Scalable control synthesis for stochastic systems via structural imdp abstractions
• Lumpability for uncertain continuous-time Markov chains

This page was built for publication: Polynomial-time alternating probabilistic bisimulation for interval MDPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045376)