Generalized Parity Games

DOI10.1007/978-3-540-71389-0_12MaRDI QIDQ5758061zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Nir Piterman, Thomas A. Henzinger

Publication date 7 September 2007

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71389-0_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 2247836
• Partial solvers for generalized parity games
• Parity games on undirected graphs
• A brief excursion to parity games
• scientific article; zbMATH DE number 1261120
• Parameterized Algorithms for Parity Games
• A matrix-based approach to parity games
• Algorithms for Parity Games
• Solving parity games in practice
• Parity game reductions

Cited in

(33)

• Parity game reductions
• Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
• Timed games with bounded window parity objectives
• Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
• Partial solvers for generalized parity games
• scientific article; zbMATH DE number 6374006 (Why is no real title available?)
• Graph Games and Reactive Synthesis
• Constrained existence problem for weak subgame perfect equilibria with -regular Boolean objectives
• A survey of stochastic -regular games
• Fatal Attractors in Parity Games
• scientific article; zbMATH DE number 7356850 (Why is no real title available?)
• Parameterized complexity of games with monotonically ordered \(\omega\)-regular objectives
• Window parity games: an alternative approach toward parity games with time bounds
• Games where you can play optimally with arena-independent finite memory
• Deciding Parity Games in Quasi-polynomial Time
• scientific article; zbMATH DE number 7533361 (Why is no real title available?)
• scientific article; zbMATH DE number 7559480 (Why is no real title available?)
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
• Combinations of Qualitative Winning for Stochastic Parity Games
• Poster Abstract: Permissiveness for Strategy Adaptation
• A matrix-based approach to parity games
• Synthesizing permissive winning strategy templates for parity games
• Checking history-determinism is NP-hard for parity automata
• New algorithms for combinations of objectives using separating automata
• Degrees of ambiguity for parity tree automata
• Reversible transducers over infinite words
• Lookahead games and efficient determinisation of history-deterministic Büchi automata
• Games with trading of control
• Contract-based distributed logical controller synthesis
• Games with -automatic preference relations
• Coverage games
• From trees to tree-like: distribution and synthesis for asynchronous automata
• Contract-based multi-agent logical controller synthesis under uncertainty

This page was built for publication: Generalized Parity Games

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