Strategy construction for parity games with imperfect information
Authors:
- Dietmar BerwangerDBDietmar Berwanger
- Krishnendu ChatterjeeKCKrishnendu Chatterjee
- Martin De WulfMWMartin De Wulf
- Laurent DoyenLDLaurent Doyen
- Thomas A. HenzingerTHThomas A. Henzinger
- 1 October 2010
- journal article
- Published by Elsevier in Information and Computation
- Vol. 208 (10) , 1206-1220
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Antichains for the Automata-Based Approach to Model-CheckingLogical Methods in Computer Science, 2009
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata2008
- Algorithms for Omega-Regular Games with Imperfect InformationLogical Methods in Computer Science, 2007
- Assume-Guarantee Synthesis2007
- A Lattice Theory for Solving Games of Imperfect InformationLecture Notes in Computer Science, 2006
- Permissive strategies: from parity games to safety gamesRAIRO - Theoretical Informatics and Applications, 2002
- Infinite games on finitely coloured graphs with applications to automata on infinite treesTheoretical Computer Science, 1998
- Languages, Automata, and Logic1997
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- The complexity of two-player games of incomplete informationJournal of Computer and System Sciences, 1984