Parity and exploration games on infinite graphs

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

Volumn 3210, Issue , 2004, Pages 56-70

  Gimbert, Hugo ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BOOLEAN COMBINATIONS; EXPONENTIAL TIME; INFINITE GRAPH; PERFECT INFORMATIONS; POSITIONAL WINNING STRATEGY; PUSHDOWN GRAPHS; WINNING CONDITIONS;

ARTIFICIAL INTELLIGENCE;

EID: 24044546581     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_8     Document Type: Article

References (23)

1. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controlers with partial observation. Theoretical Computer Science, 303(1):7-34, 2003.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR'97, LNCS, volume 1243, pages 135-150, 1997.
3. A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with unboudedness and regular conditions. In Proc. of FSTTCS'03, LNCS, volume 2914, pages 88-99, 2003.
4. T. Cachat. Symbolic strategy for games on pushdown graphs. In Proc. of 29th ICALP, LNCS, volume 2380, pages 704-715, 2002.
5. 3 winning condition. In Proc. of CSL 2002, LNCS, volume 2471, pages 322-336, 2002.
6. K. Chatterejee, M. Jurdziński, and T. A. Henzinger. Simple stochastic parity games. In CSL'03, volume 2803 of LNCS, pages 100-113. Springer, 2003.
7. L. de Alfaro and T.A. Henzinger. Concurrent ω-regular games. In LICS'00, pages 142-154. IEEE Computer Society Press, 2000.
8. L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In FOCS'98, pages 564-575. IEEE Computer Society Press, 1998.
9. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. of 32th FOCS, pages 368-377. IEEE Computer Society Press, 1991.
10. H. Gimbert. Parity and exploration games on infinite graphs, full version. www.liafa.jussieu.fr/~hugo.
11. E. Grädel. Positional determinacy of infinite games. In STAGS 2004, LNCS, volume 2996, pages 4-18, 2004.
12. O. Kupferman, N. Piterman, and M. Vardi. Pushdown specifictaions. In Proc. of LPAR'02, LNCS, October 2002.
13. O. Kupferman and M.Y. Vardi. An automata-theoretic approach to reasoning about infinite state systems. In Proc. of CAV'00, LNCS, volume 1855, pages 36-52, 2000.
14. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata and second order logic. Thoretical Computer Science, 37:51-75, 1985.
15. D. E. Muller and P. E. Schupp. Simulating alternating tree automata by non-deterministic automata. Theoretical Computer Science, 141:69-107, 1995.
16. N. Piterman and M.Vardi. From bidirectionnality to alternation. Theoretical Computer Science, 295:295-321, 2003.
17. O. Serre. Games with winning conditions of high borel complexity, to appear in proc. of icalp'04.
18. O. Serre. Note on winning positions on pushdown games with omega-regular conditions. Information Processing Letters, 85(6):285-291, 2003.
19. W. Thomas. On the synthesis of strategies in infinite games. In Proc. of STACS'95,LNCS, volume 900, pages 1-13, 1995.
20. M. Vardi. Reasoning about the past with two-way automata. In Proc. of ICALP'98, LNCS, volume 1443, pages 628-641, 1998.
21. I. Walukiewicz. Pushdown processes: Games and model checking. In Proc. of CAV'96, LNCS, volume 1102, pages 62-74, 1996.
22. I. Walukiewicz. Pushdown processes: Games and model checking. Information and Computation, 164(2):234-263, 2001.
23. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200:135-183, 1998.