Automatic verification of concurrent stochastic systems
DOI10.1007/s10703-020-00356-yzbMath1505.68025arXiv2008.04613OpenAlexW3124931799WikidataQ112268299 ScholiaQ112268299MaRDI QIDQ2147696
Publication date: 20 June 2022
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.04613
Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strategy improvement for concurrent reachability and turn-based stochastic safety games
- A survey of stochastic \(\omega \)-regular games
- A new polynomial-time algorithm for linear programming
- Enumeration of Nash equilibria for two-player games
- Subgame-perfect equilibria of finite- and infinite-horizon games
- Nash and correlated equilibria: Some complexity considerations
- On the complexity of the parity argument and other inefficient proofs of existence
- A logic for reasoning about time and reliability
- Compositional strategy synthesis for stochastic games with multiple objectives
- The many facets of linear programming
- Quantitative solution of omega-regular games
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Automatic verification of competitive stochastic systems
- The complexity of solving reachability games using value and strategy iteration
- Concurrent reachability games
- Interval iteration algorithm for MDPs and IMDPs
- A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
- On Stochastic Games with Multiple Objectives
- The Complexity of the Simplex Method
- Model checking of probabilistic and nondeterministic systems
- Mixed Nash Equilibria in Concurrent Terminal-Reward Games
- Alternating-time temporal logic
- Verification of Markov Decision Processes Using Learning Algorithms
- Value Iteration
- Algorithms for stochastic games ? A survey
- The determinacy of Blackwell games
- Evolutionary Dynamics of Collective Action
- Approximating Values of Generalized-Reachability Stochastic Games
- Automated Verification and Strategy Synthesis for Probabilistic Systems
- Results on the quantitative μ-calculus qM μ
- Computer Science Logic
- Equilibrium Points of Bimatrix Games
- Algorithmic Game Theory
- Equilibrium points in n -person games
- Stochastic Games
- Zermelo and the early history of game theory
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Automated Verification of Concurrent Stochastic Games
This page was built for publication: Automatic verification of concurrent stochastic systems
