Algorithms for omega-regular games with imperfect information

Logical Methods in Computer Science

Volumn 3, Issue 3, 2007, Pages

  Chatterjee, Krishnendu ^a   Doyen, Laurent ^b   Henzinger, Thomas A ^a,b   Raskin, Jean François ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b EPFL   (Switzerland)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

2 player games; Algorithms; Antichains; Partial information; Randomized strategies

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COMPUTERS;

2-PLAYER GAMES; ANTICHAINS; FIXED-POINT ALGORITHMS; IMPERFECT INFORMATION; PARTIAL INFORMATION; PERFECT INFORMATIONS; RANDOMIZED STRATEGY; SUBSET CONSTRUCTIONS;

DIRECTED GRAPHS;

EID: 84995335523     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(3:4)2007     Document Type: Article

References (22)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable specifications of reactive systems. In ICALP, LNCS 372, pages 1-17. Springer, 1989.
2. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. J. ACM, 49:672-713, 2002.
3. A.K. Chandra, D. Kozen, and L.J. Stockmeyer. Alternation. J. ACM, 28:114-133, 1981.
4. K. Chatterjee and T.A. Henzinger. Semiperfect-information games. In FSTTCS, LNCS 3821, pages 1-18. Springer, 2005.
5. L. de Alfaro and T.A. Henzinger. Concurrent-regular games. In Proc. LICS, pages 141-154. IEEE Computer Society, 2000.
6. L. de Alfaro and T.A. Henzinger. Interface automata. In Proc. FSE, pages 109-120. ACM, 2001.
7. L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In Proc. FOCS, pages 564-575. IEEE Computer Society, 1998.
8. L. de Alfaro, T.A. Henzinger, and R. Majumdar. From verification to control: Dynamic programs for !-regular objectives. In Proc. LICS, pages 279-290. IEEE Computer Society, 2001.
9. M. De Wulf, L. Doyen, T.A. Henzinger and J.-F. Raskin. Antichains: A new algorithm for checking universality of finite automata. In CAV, LNCS (to appear). Springer, 2006.
10. M. De Wulf, L. Doyen, and J.-F. Raskin. A lattice theory for solving games of imperfect information. In HSCC, LNCS 3927, pages 153-168. Springer, 2006.
11. D. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. MIT Press, 1989.
12. E.A. Emerson and C.S. Jutla. Tree automata, μ-calculus, and determinacy. In Proc. FOCS, pages 368-377. IEEE Computer Society, 1991.
13. A. Kechris. Classical Descriptive Set Theory. Springer, 1995.
14. O. Kupferman and M.Y. Vardi. Synthesis with incomplete information. In Advances in Temporal Logic (H. Barringer et al., eds.), pages 109-127. Kluwer, 1999.
15. M.L. Littman. Algorithms for Sequential Decision Making. PhD Thesis, Brown Univ., 1996.
16. D. Martin. Borel determinacy. Annals of Mathematics, 102:363-371, 1975.
17. A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In ICALP, LNCS 372, pages 652-671. Springer, 1989.
18. P.J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete-event processes. SIAM J. Control and Optimization, 25:206-230, 1987.
19. J.H. Reif. The complexity of two-player games of incomplete information. J. Computer and System Sciences, 29:274-301, 1984.
20. S. Safra. On the complexity of !-automata. In Proc. FOCS, pages 319-327. IEEE Computer Society Press, 1988.
21. W. Thomas. Languages, automata, and logic. In Handbook of Formal Languages (G. Rozenberg et al., eds.), volume 3, pages 389-455. Springer, 1997.
22. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Proc. FOCS, pages 327-338. IEEE Computer Society, 1985.