Verification of multiplayer stochastic games via abstract dependency graphs
From MaRDI portal
Publication:2119119
DOI10.1007/978-3-030-68446-4_13OpenAlexW3131199573MaRDI QIDQ2119119
Søren Enevoldsen, Anders Mariegaard, Mathias Claus Jensen, Jiří Srba, Kim Guldstrand Larsen
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-68446-4_13
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative verification and strategy synthesis for stochastic games
- Handbook of weighted automata
- Symmetry breaking in distributed networks
- The complexity of stochastic games
- Distributed computation of fixed points on dependency graphs
- Ensuring the reliability of your model checker: interval iteration for Markov decision processes
- Optimistic value iteration
- Automatic verification of competitive stochastic systems
- Strategy synthesis for multi-dimensional quantitative objectives
- Multi-cost bounded reachability in MDP
- A lattice-theoretical fixpoint theorem and its applications
- On Stochastic Games with Multiple Objectives
- Energy Games in Multiweighted Automata
- Alternating-time temporal logic
- A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*
- Approximating Values of Generalized-Reachability Stochastic Games
- Formal Modeling and Analysis of Timed Systems
- Stochastic Games
- CONCUR 2005 – Concurrency Theory
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Sound value iteration
- Abstract Dependency Graphs and Their Application to Model Checking
