Solving parity games via priority promotion
type: Item
instance of: scholarly article
title: Solving parity games via priority promotion
zbMATH Open document ID: 1390.68332
author: Massimo Benerecetti
author: Daniele Dell'Erba
author: Fabio Mogavero
published in: Formal Methods in System Design
publication date: 2018-04-12T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6859142
zbMATH Keywords: parity games
zbMATH Keywords: infinite-duration games on graphs
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: formal methods
describes a project that uses: PGSolver
MaRDI profile type: Publication
OpenAlex ID: W2791055336
cites work: PRIMES is in P
cites work: Alternating-time temporal logic
cites work: Q3083813
cites work: Solving Parity Games via Priority Promotion
cites work: Substructure Temporal Logic
cites work: Reasoning About Substructures and Games
cites work: DAG-Width and Parity Games
cites work: Games and Model Checking for Guarded Logics
cites work: Fixed-point logics and solitaire games
cites work: Entanglement and the complexity of directed graphs
cites work: Deciding parity games in quasipolynomial time
cites work: Energy parity games
cites work: Generalized mean-payoff and energy games
cites work: Finitary winning in ω-regular games
cites work: Parity and Streett Games with Costs
cites work: Strategy logic
cites work: The complexity of stochastic games
cites work: Positional strategies for mean payoff games
cites work: On model checking for the \(\mu\)-calculus and its fragments
cites work: Q4722045
cites work: Non-oblivious Strategy Improvement
cites work: Parity Games on Graphs with Medium Tree-Width
cites work: Time and Parallelizability Results for Parity Games with Bounded Treewidth
cites work: Self-witnessing polynomial-time complexity and prime factorization
cites work: Q2957486
cites work: Solving Parity Games in Practice
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs
cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
cites work: Q4501540
cites work: Q5144638
cites work: A deterministic subexponential algorithm for solving parity games
cites work: A Deterministic Subexponential Algorithm for Solving Parity Games
cites work: Q4542592
cites work: Borel determinacy
cites work: Q4722064
cites work: Infinite games played on finite graphs
cites work: What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
cites work: Reasoning About Strategies
cites work: On Promptness in Parity Games
cites work: Reasoning about strategies
cites work: Q3753490
cites work: Computer Aided Verification
cites work: Clique-Width and Parity Games
cites work: Solving Parity Games in Big Steps
cites work: An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
cites work: ATL* Satisfiability Is 2EXPTIME-Complete
cites work: Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
cites work: Q2754084
cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus
cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees
cites work: The complexity of mean payoff games on graphs
DOI: 10.1007/S10703-018-0315-1
description: scientific article; zbMATH DE number 6859142