Quantitative verification and strategy synthesis for stochastic games
From MaRDI portal
(Redirected from Publication:328165)
Recommendations
- Model checking and strategy synthesis for stochastic games: from theory to practice (invited talk)
- Automatic verification of concurrent stochastic systems
- Automated Verification of Concurrent Stochastic Games
- Automatic verification of competitive stochastic systems
- PRISM-games: a model checker for stochastic multi-player games
Cites work
- scientific article; zbMATH DE number 3128733 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 1416652 (Why is no real title available?)
- A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
- A pumping algorithm for ergodic stochastic mean payoff games with perfect information
- A subexponential randomized algorithm for the simple stochastic game problem
- A survey of partial-observation stochastic parity games
- A survey of stochastic -regular games
- Automata, Languages and Programming
- Automated verification and strategy synthesis for probabilistic systems
- Automatic verification of competitive stochastic systems
- Comparison of LTL to Deterministic Rabin Automata Translators
- Compositional controller synthesis for stochastic games
- Compositional probabilistic verification through multi-objective model checking
- Continuous-time stochastic games with time-bounded reachability
- Expected reachability-time games
- Formal Verification and Synthesis for Discrete-Time Stochastic Systems
- Model checking of probabilistic and nondeterministic systems
- Multi-objective discounted reward verification in graphs and MDPs
- On stochastic games with multiple objectives
- Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
- PRISM-games: a model checker for stochastic multi-player games
- Parityizing Rabin and Streett
- Partial-observation stochastic games, how to win when belief fails
- Playing stochastic games precisely
- Probabilistic automata
- QUASY: quantitative synthesis tool
- Quantitative multi-objective verification for probabilistic systems
- Quantitative stochastic parity games
- Reachability in Stochastic Timed Games
- Recursive Concurrent Stochastic Games
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Stochastic Games
- Stochastic Games with Perfect Information and Time Average Payoff
- Stochastic games with imperfect monitoring
- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
- Strategy Improvement for Stochastic Rabin and Streett Games
- The Complexity of Markov Decision Processes
- The complexity of Nash equilibria in stochastic multiplayer games
- The complexity of partial-observation stochastic parity games with finite-memory strategies
- The complexity of solving stochastic games on graphs
- The complexity of stochastic games
- The determinacy of Blackwell games
- Value Iteration
Cited in
(21)- Verification and Control of Turn-Based Probabilistic Real-Time Games
- Comparison of algorithms for simple stochastic games
- Playing Against Fair Adversaries in Stochastic Games with Total Rewards
- Comparison of algorithms for simple stochastic games
- Automated Verification of Concurrent Stochastic Games
- Symbolic verification and strategy synthesis for turn-based stochastic games
- Optimistic and topological value iteration for simple stochastic games
- A simple algorithm for solving qualitative probabilistic parity games
- A Game-Theoretic Approach to Simulation of Data-Parameterized Systems
- Compositional strategy synthesis for stochastic games with multiple objectives
- Games, Time, and Probability: Graph Models for System Design and Analysis
- Automatic verification of concurrent stochastic systems
- Model checking and strategy synthesis for stochastic games: from theory to practice (invited talk)
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- Security-aware synthesis using delayed-action games
- Stochastic games with lexicographic objectives
- Verifying the gaming strategy of self-learning game by using PRISM-games
- Verification of multiplayer stochastic games via abstract dependency graphs
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- PRISM-games: a model checker for stochastic multi-player games
- Automatic verification of competitive stochastic systems
Describes a project that uses
Uses Software
This page was built for publication: Quantitative verification and strategy synthesis for stochastic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328165)
