Two local strategy iteration schemes for parity game solving

DOI10.1142/S0129054112400333zbMATH Open1246.91025OpenAlexW1986303408MaRDI QIDQ2909223FDOQ2909223

Authors: Oliver Friedmann, Martin Lange 

Publication date: 30 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054112400333

Recommendations

• Local strategy improvement for parity game solving
• Solving parity games in practice
• Solving parity games via priority promotion
• scientific article; zbMATH DE number 1670778
• Solving parity games via priority promotion

zbMATH Keywords

parity gameslocal solvingstrategy iterationmodal \(\mu \) calculus

Mathematics Subject Classification ID

2-person games (91A05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Other applications of logic (03B80)

Cites Work

• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Games for synthesis of controllers with partial observation.
• Model Checking Games for Branching Time Logics

Cited In (6)

• A superpolynomial lower bound for strategy iteration based on snare memorization
• Practical synthesis of reactive systems from LTL specifications via parity games
• The fixpoint-iteration algorithm for parity games
• Efficient parallel strategy improvement for parity games
• Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
• Local strategy improvement for parity game solving

Uses Software

• PGSolver

This page was built for publication: Two local strategy iteration schemes for parity game solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909223)