Solving pushdown games with a Σ3 winning condition

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

Volumn 2471, Issue , 2002, Pages 322-336

  Cachat, Thierry ^a   Duparc, Jacques ^a   Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GAME THEORY;

BOREL HIERARCHY; GAME GRAPHS; INFINITE TWO-PLAYER GAME; PUSHDOWN GAMES; PUSHDOWN GRAPHS; SECOND LEVEL; WINNING CONDITIONS; WINNING STRATEGY;

COMPUTER CIRCUITS;

EID: 84947732368     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_22     Document Type: Conference Paper

References (16)

1. [1] A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking, CONCUR ’97, LNCS 1243, pp 135-150, 1997.
2. [2] J.R. Büchi, Landweber L.H., Solving sequential conditions by finite-state strategy. Transactions of the American Mathematical Society vol. 138 (1969) 295–311.
3. [3] J.R. Büchi, State-strategies for games in Fσδ ∩Gδσ J. Symbolic Logic 48 (1983), no. 4, 1171–1198.
4. T. Cachat, Symbolic strategy synthesis for games on pushdown graphs, in: ICALP’02, Springer LNCS (to appear). http://www-i7.informatik.rwth-aachen.de/~cachat/
5. [5] E.A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, FoCS ’91, IEEE Computer Society Press (1991), pp. 368–377.
6. [6] O. Finkel, Topological properties of omega context-free languages, Theoret. Comput. Sci. 262 (2001), no. 1-2, 669–697.
7. [7] O. Finkel, Wadge hierarchy of omega context-free languages, Theoret. Comput. Sci. 269 (2001), no. 1-2, 283–315.
8. [8] J.E. Hopcroft and J. D. Ullman, Formal Languages and their relation to automata, Addison-Wesley, 1969.
9. [9] A. S. Kechris, Classical descriptive set theory, Graduate texts in mathematics, vol 156, Springer Verlag (1994).
10. [10] O. Kupferman and M. Y. Vardi, An Automata-Theoretic Approach to Reasoning about Infinite-State Systems, CAV 2000, LNCS 1855, 2000.
11. [11] S. Seibert, Effektive Strategiekonstruktionen für Gale-Stewart-Spiele auf Transitionsgraphen, Technical Report 9611, Institut für Informatik undP raktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany, July 1996.
12. [12] C. Stirling, Modal and Temporal Properties of Processes, Springer (Texts in Computer Science), 2001.
13. [13] W. Thomas, On the synthesis of strategies in infinite games, STACS ’95, LNCS 900, pp. 1–13, 1995.
14. [14] W. Thomas, Languages, automata, andlogic, in Handbookof Formal Language Theory (G. Rozenberg, A. Salomaa, Eds.), Vol 3, Springer-Verlag, Berlin 1997, pp. 389–455.
15. [15] W.W. Wadge Reducibility and Determinateness on the Baire Space Ph.D. Thesis, University of California, Berkeley, 1984.
16. [16] I. Walukiewicz, Pushdown processes: games and model checking, CAV ’96, LNCS 1102, pp 62-74, 1996. Full version in Information andCom putation 157, 2000.