Value Iteration

DOI10.1007/978-3-540-69850-0_7zbMath1143.68042OpenAlexW2914135999MaRDI QIDQ3512436

Krishnendu Chatterjee, Thomas A. Henzinger

Publication date: 15 July 2008

Published in: 25 Years of Model Checking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69850-0_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (15)

Expected reachability-time games ⋮ Reachability in MDPs: Refining Convergence of Value Iteration ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Interval iteration algorithm for MDPs and IMDPs ⋮ Automatic verification of concurrent stochastic systems ⋮ Quantitative verification and strategy synthesis for stochastic games ⋮ Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications ⋮ Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Symbolic verification and strategy synthesis for turn-based stochastic games ⋮ Optimistic and topological value iteration for simple stochastic games ⋮ Unnamed Item ⋮ Exact quantitative probabilistic model checking through rational search ⋮ Automatic verification of competitive stochastic systems ⋮ Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games ⋮ Comparison of algorithms for simple stochastic games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Stochastic limit-average games are in EXPTIME
• Reduction of stochastic parity to stochastic mean-payoff games
• The complexity of stochastic games
• A characterization of the minimum cycle mean in a digraph
• The complexity of mean payoff games on graphs
• Quantitative solution of omega-regular games
• Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
• Alternating-time temporal logic
• A deterministic subexponential algorithm for solving parity games
• The complexity of quantitative concurrent parity games
• Concurrent Games with Tail Objectives
• The complexity of probabilistic verification
• Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
• Stochastic Games with Perfect Information and Time Average Payoff
• Stochastic Games
• Stochastic games

This page was built for publication: Value Iteration