Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
From MaRDI portal
Publication:2961570
DOI10.1007/978-3-319-52234-0_15zbMath1484.68141arXiv1607.01474OpenAlexW2962932901MaRDI QIDQ2961570
Andrea Turrini, Sven Schewe, Ernst Moritz Hahn, Li-jun Zhang
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.01474
Games involving graphs (91A43) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving parity games in big steps
- Strategy improvement for concurrent reachability and turn-based stochastic safety games
- The complexity of stochastic Müller games
- Results on the propositional \(\mu\)-calculus
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- An improved algorithm for the evaluation of fixpoint expressions
- Quantitative solution of omega-regular games
- A subexponential randomized algorithm for the simple stochastic game problem
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
- Non-oblivious Strategy Improvement
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Symmetric Strategy Improvement
- Alternating-time temporal logic
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- The complexity of quantitative concurrent parity games
- Synthesis of Asynchronous Systems
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- Solving Simple Stochastic Games with Few Random Vertices
- Solving Parity Games in Practice
- The Complexity of Solving Stochastic Games on Graphs
- The complexity of probabilistic verification
- Quantitative solution of omega-regular games380872
- Foundations of Software Science and Computation Structures
- PRISM-games: A Model Checker for Stochastic Multi-Player Games
- Lazy probabilistic model checking without determinisation
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
- DAG-Width and Parity Games
- Strategy Improvement for Stochastic Rabin and Streett Games
- Computer Aided Verification
- On model checking for the \(\mu\)-calculus and its fragments
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
This page was built for publication: Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
