Reachability in MDPs: Refining Convergence of Value Iteration

DOI10.1007/978-3-319-11439-2_10zbMath1393.68102OpenAlexW1626822335MaRDI QIDQ3447700

Serge Haddad, Benjamin Monmege

Publication date: 28 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

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)

Related Items (11)

Reachability in MDPs: Refining Convergence of Value Iteration ⋮ Interval iteration algorithm for MDPs and IMDPs ⋮ Markov automata with multiple objectives ⋮ Bounded Verification of Reachability of Probabilistic Hybrid Systems ⋮ Unnamed Item ⋮ Markov chains and Markov decision processes in Isabelle/HOL ⋮ Multi-cost bounded tradeoff analysis in MDP ⋮ Exact quantitative probabilistic model checking through rational search ⋮ Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata ⋮ Unnamed Item ⋮ Lifted model checking for relational MDPs

Cites Work

• Unnamed Item
• A game-based abstraction-refinement framework for Markov decision processes
• Reachability in MDPs: Refining Convergence of Value Iteration
• Verification of Markov Decision Processes Using Learning Algorithms
• Value Iteration

This page was built for publication: Reachability in MDPs: Refining Convergence of Value Iteration