Strategy construction for parity games with imperfect information

Information and Computation

Volumn 208, Issue 10, 2010, Pages 1206-1220

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

^a UNIVERSITÉ PARIS SACLAY   (France)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^d EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ANTICHAIN; CLOSEDNESS; COMPLEMENTATION; FIXED-POINT COMPUTATION; IMPERFECT INFORMATION; INFORMATION GAME; PARITY GAMES; PROBLEM INSTANCES; REACHABILITY; STATE-SETS; SUCCINCT REPRESENTATION; WINNING STRATEGY;

ALGORITHMS;

EID: 77955768505     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2009.09.006     Document Type: Conference Paper

References (21)

1. W. Thomas On the synthesis of strategies in infinite games Proc. of STACS 1995 1995 Springer-Verlag 1 13
2. E. Grädel, W. Thomas, T. Wilke, Automata, Logics, and Infinite Games LNCS 2500 2002 Springer-Verlag
3. E.A. Emerson, and C.S. Jutla Tree automata, mu-calculus and determinacy Proc. of FoCS 1991 1991 IEEE 368 377
4. D. Fudenberg, and J. Tirole Game Theory 1991 MIT Press
5. J. Reif The complexity of two-player games of incomplete information Journal of Computer and System Sciences 29 1984 274 301
6. K. Chatterjee, L. Doyen, T.A. Henzinger, J.-F. Raskin, Algorithms for omega-regular games of incomplete information, Logical Methods in Computer Science 3(3:4) (2007).
7. T.A. Henzinger, R. Jhala, and R. Majumdar Counterexample-guided control Proc. of ICALP 2003 LNCS 2719 2003 Springer-Verlag 886 902
8. R. McNaughton Infinite games played on finite graphs Annals of Pure and Applied Logic 65 2 1993 149 184
9. W. Zielonka Infinite games on finitely coloured graphs with applications to automata on infinite trees Theoretical Computer Science 200 1998 135 183
10. W. Thomas Languages, automata, and logic Handbook of Formal Languages 3 1997 389 455
11. D. Berwanger, L. Doyen, On the power of imperfect information, in: Proc. of FSTTCS 2008, Dagstuhl Seminar Proceedings 08004, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), 2008.
12. M. De Wulf, L. Doyen, T.A. Henzinger, and J.-F. Raskin Antichains: a new algorithm for checking universality of finite automata Proc. of CAV 2006 LNCS 4144 2006 Springer-Verlag 17 30
13. M. De Wulf, L. Doyen, N. Maquet, and J.-F. Raskin Antichains: alternative algorithms for LTL satisfiability and model-checking Proc. of TACAS 2008 LNCS 4693 2008 Springer-Verlag 63 77
14. M. De Wulf, L. Doyen, J.-F. Raskin, A lattice theory for solving games of imperfect information, in: Proc. of HSCC 2006, LNCS 3927, Springer-Verlag, 2006, pp. 153-168, ISBN 3-540-33170-0. (Pubitemid 44019585)
15. D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T.A. Henzinger Alpaga: a tool for solving parity games with imperfect information Proc. of TACAS 2009 LNCS 5505 2009 Springer 58 61
16. F. Somenzi, CUDD: Colorado University Decision Diagram Package, 2005. Available from: .
17. B. Jobstmann, A. Griesmayer, R. Bloem, Program repair as a game, in: Proc. of CAV: Computer-Aided Verification, LNCS 3576, Springer, 2005, pp. 226-238.
18. J. Bernet, D. Janin, and I. Walukiewicz Permissive strategies: from parity games to safety games Informatique Théorique et Applications 36 3 2002 261 275
19. K. Chatterjee, T.A. Henzinger, Assume-guarantee synthesis, in: Proc. of TACAS 2007, LNCS 4424, Springer, 2007, pp. 261-275.
20. A. Bouajjani, P. Habermehl, L. Holík, T. Touili, T. Vojnar, Antichain-based universality and inclusion testing over nondeterministic finite tree automata, in: Proc. of CIAA 2008, LNCS 5148, Springer, 2008, pp. 57-67.
21. L. Doyen, J.-F. Raskin, Antichains for the automata-based approach to model-checking, Journal Logical Methods in Computer Science 5(1:5) (2009).