Verification of Indefinite-Horizon POMDPs

DOI10.1007/978-3-030-59152-6_16MaRDI QIDQ6485882zbMATH OpenFDO

Authors Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann

Publication date 22 December 2022

Published in 1517.68225 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59152-6_16

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Markov and semi-Markov decision processes (90C40)

Recommendations

• Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
• Enforcing almost-sure reachability in POMDPs
• Scenario-based verification of uncertain MDPs
• scientific article; zbMATH DE number 468936
• Verification of general Markov decision processes by approximate similarity relations and policy refinement
• Verification of general Markov decision processes by approximate similarity relations and policy refinement
• Verification of Markov decision processes using learning algorithms
• POMDPs under probabilistic semantics
• Parameter-Independent Strategies for pMDPs via POMDPs
• Verification and control of partially observable probabilistic systems

Cited in

(7)

• Task-aware verifiable RNN-based policies for partially observable Markov decision processes
• Robust almost-sure reachability in multi-environment MDPs
• Under-approximating expected total rewards in POMDPs
• Search and explore: symbiotic policy synthesis in POMDPs
• Search and explore: symbiotic policy synthesis in POMDPs
• A framework for belief-based programs and their verification
• Enforcing almost-sure reachability in POMDPs

This page was built for publication: Verification of Indefinite-Horizon POMDPs

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