Strategy construction for parity games with imperfect information

DOI10.1016/j.ic.2009.09.006zbMath1232.91007OpenAlexW2020824258MaRDI QIDQ1959483

Krishnendu Chatterjee, Martin De Wulf, Thomas A. Henzinger, Laurent Doyen, Dietmar Berwanger

Publication date: 7 October 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.09.006

Mathematics Subject Classification ID

2-person games (91A05)

Related Items

Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus, Graph operations on parity games and polynomial-time algorithms, Uniform strategies, rational relations and jumping automata, Compositional construction of most general controllers

Uses Software

• Alpaga
• CUDD
• Antichains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Automata, logics, and infinite games. A guide to current research
• Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
• Antichains for the Automata-Based Approach to Model-Checking
• On the synthesis of strategies in infinite games
• Permissive strategies: from parity games to safety games
• Algorithms for Omega-Regular Games with Imperfect Information
• Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
• Computer Aided Verification
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Assume-Guarantee Synthesis
• Hybrid Systems: Computation and Control