Interval iteration algorithm for MDPs and IMDPs
From MaRDI portal
Publication:2636515
DOI10.1016/j.tcs.2016.12.003zbMath1393.68103OpenAlexW2568766587MaRDI QIDQ2636515
Benjamin Monmege, Serge Haddad
Publication date: 5 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.003
Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (11)
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities ⋮ Runtime monitors for Markov decision processes ⋮ Automatic verification of concurrent stochastic systems ⋮ Abstraction-based synthesis for stochastic systems with omega-regular objectives ⋮ Bounding fixed points of set-based Bellman operator and Nash equilibria of stochastic games ⋮ Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Optimistic and topological value iteration for simple stochastic games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Are Parametric Markov Chains Monotonic? ⋮ Comparison of algorithms for simple stochastic games
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A game-based abstraction-refinement framework for Markov decision processes
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes
- Quantitative Multi-objective Verification for Probabilistic Systems
- Reachability in MDPs: Refining Convergence of Value Iteration
- Verification of Markov Decision Processes Using Learning Algorithms
- Value Iteration
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Interval iteration algorithm for MDPs and IMDPs