Games with winning conditions of high Borel complexity

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

Volumn 3142, Issue , 2004, Pages 1150-1162

  Serre, Olivier ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Borel Complexity; Pushdown Automata; Two player Games

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY;

BOREL COMPLEXITY; BOREL HIERARCHY; FINITE GRAPHS; INFINITE TWO-PLAYER GAME; PUSH-DOWN AUTOMATA; PUSHDOWN GRAPHS; TWO-PLAYER GAMES; WINNING CONDITIONS;

GAME THEORY;

EID: 33645490395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_95     Document Type: Article

References (15)

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. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with the unboundedness and regular conditions. In Proceedings of FST TCS 2003, volume 2914 of Lecture-Notes in Computer Science, pages 88-99. Springer, 2003.
3. T. Cachat. Uniform solution of parity games on prefix-recognizable graphs, volume 68 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002.
4. 3 winning condition. In Proceedings of CSL 2002, volume 2471 of Lecture Notes in Computer Science, pages 322-336. Springer, 2002.
5. J. Duparc. Wadge hierarchy and Veblen hierarchy, part I: Borel sets of finite rank. Journal of Symbolic Logic, 66(1):56-86, 2001.
6. E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model-checking for the mu-calculus and its fragments. Theoretical Computer Science, 258(1-2):491-522, 2001.
7. M. Jurdziński. Small progress measures for solving parity games. In Proceeding of STAGS 2000, volume 1770 of Lecture Notes in Computer Science, pages 290-301. Springer-Verlag, 2000.
8. J. Marcinkowski and T. Truderung. Optimal complexity bounds for positive LTL games. In Proceedings of CSL 2002, volume 2471 of Lecture Notes in Computer Science, pages 262-275. Springer, 2002.
9. D.A. Martin. Borel determinacy. Annals of Mathematics, 102(363-371), 1975.
10. O. Serre. Note on winning positions on pushdown games with w-regular conditions. Information Processing Letters, 85:285-291, 2003.
11. W. Thomas. On the synthesis of strategies in infinite games. In Proceedings of STAGS '95, volume 900 of Lecture Notes in Computer Science, pages 1-13. Springer, 1995.
12. W. Thomas. Infinite games and verification (extended abstract of a tutorial). In Proceedings of CAV 2002, volume 2404 of Lecture Notes in Computer Science, pages 58-64. Springer, 2002.
13. J. Vöge and M. Jurdziński. A discrete strategy improvement algorithm for solving parity games. In Proceedings of CAV 2000, volume 1855 of Lecture Notes in Computer Science, pages 202-215. Springer-Verlag, 2000.
14. I. Walukiewicz. Pushdown processes: games and model checking. Information and Computation, 157:234-263, 2000.
15. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200(1-2):135-183, 1998.