Strategy Construction for Parity Games with Imperfect Information
From MaRDI portal
Publication:3541028
DOI10.1007/978-3-540-85361-9_27zbMath1160.68455MaRDI QIDQ3541028
Krishnendu Chatterjee, Thomas A. Henzinger, Dietmar Berwanger, Laurent Doyen, Sangram Raje
Publication date: 25 November 2008
Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.7407
91A43: Games involving graphs
03B70: Logic in computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Strategy Construction for Parity Games with Imperfect Information, Modal and mixed specifications: key decision problems and their complexities, Computing Weakest Strategies for Safety Games of Imperfect Information
Cites Work
- 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
- Strategy Construction for Parity Games with Imperfect Information
- On the synthesis of strategies in infinite games
- Algorithms for Omega-Regular Games with Imperfect Information
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Antichains: A New Algorithm for Checking Universality of Finite Automata
