Improving parity games in practice
From MaRDI portal
Publication:2043434
DOI10.1007/s10472-020-09721-3OpenAlexW3123479446MaRDI QIDQ2043434
Vincenzo Prignano, Antonio Di Stasio, Aniello Murano, Loredana Sorrentino
Publication date: 2 August 2021
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-020-09721-3
Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Improved model checking of hierarchical systems
- Results on the propositional \(\mu\)-calculus
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Solving parity games: explicit vs symbolic
- Graded modalities in strategy logic
- Module checking
- On Promptness in Parity Games*†
- Solving Parity Games Using an Automata-Based Algorithm
- Generalized Mean-payoff and Energy Games
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Admissibility in Infinite Games
- Facets of Synthesis: Revisiting Church’s Problem
- Solving Parity Games in Practice
- Solving Parity Games via Priority Promotion
- Deciding parity games in quasipolynomial time
- Polynomial-Time Under-Approximation of Winning Regions in Parity Games
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- A modal μ perspective on solving parity games in quasi-polynomial time
- Solving Parity Games on the GPU
- An automata-theoretic approach to branching-time model checking
- Solving Parity Games in Big Steps
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Attracting tangles to solve parity games
