Symbolic verification and strategy synthesis for turn-based stochastic games

DOI10.1007/978-3-031-22337-2_19zbMath1528.68229arXiv2211.06141MaRDI QIDQ6113986

No author found.

Publication date: 10 August 2023

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

Full work available at URL: https://arxiv.org/abs/2211.06141

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of stochastic \(\omega \)-regular games
• Strategy logic
• The complexity of stochastic games
• Symbolic model checking: \(10^{20}\) states and beyond
• Counterexample explanation by learning small strategies in Markov decision processes
• Quantitative solution of omega-regular games
• Multi-player equilibria verification for concurrent stochastic games
• Automatic verification of concurrent stochastic systems
• Stochastic games with lexicographic reachability-safety objectives
• \textsf{PrIC3}: property directed reachability for MDPs
• Automatic verification of competitive stochastic systems
• Alternating-time temporal logic
• Value Iteration
• Graph-Based Algorithms for Boolean Function Manipulation
• The determinacy of Blackwell games
• Symbolic model checking for probabilistic processes
• Results on the quantitative μ-calculus qM μ
• Stochastic Games
• Value iteration for simple stochastic games: stopping criterion and learning algorithm
• Model Checking for Safe Navigation Among Humans

This page was built for publication: Symbolic verification and strategy synthesis for turn-based stochastic games