Alpaga: A tool for solving parity games with imperfect information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5505 LNCS, Issue , 2009, Pages 58-61

  Berwanger, Dietmar ^a   Chatterjee, Krishnendu ^b   De Wulf, Martin ^c   Doyen, Laurent ^c,d   Henzinger, Thomas A ^d  

^a CNRS   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^d EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

IMPERFECT INFORMATION; PARITY GAMES; WINNING STRATEGY;

COMPUTER SOFTWARE; GAME THEORY;

ALGORITHMS;

EID: 70350630642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00768-2_7     Document Type: Conference Paper

References (5)

1. Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., Henzinger, T.A.: Alpaga: A tool for solving parity games with imperfect information. Technical Report MTC-REPORT-2008-007, EPFL (2008), http://infoscience.epfl.ch/record/ 130681
2. Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T.A., Raje, S.: Strategy construction for parity games with imperfect information. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 325-339. Springer, Heidelberg (2008)
3. Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science 3(3:4) (2007)
4. McNaughton, R.: Infinite games played on finite graphs. Annals of Pure and Applied Logic 65(2), 149-184 (1993)
5. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200, 135-183 (1998)