TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING

DOI10.1142/S0129054112400333zbMath1246.91025OpenAlexW1986303408MaRDI QIDQ2909223

Martin Lange, Oliver Friedmann

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

zbMATH Keywords

parity gameslocal solvingstrategy iterationmodal \(\mu \) calculus

Mathematics Subject Classification ID

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

Related Items (1)

Practical synthesis of reactive systems from LTL specifications via parity games

Uses Software

• PGSolver

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

This page was built for publication: TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING