Positional strategies for higher-order pushdown parity games

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

Volumn 5162 LNCS, Issue , 2008, Pages 217-228

  Carayol, Arnaud ^a   Slaats, Michaela ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PARITY GAMES; POSITIONAL STRATEGIES; POSITIONAL WINNING STRATEGIES; PUSHDOWN AUTOMATON; PUSHDOWN SYSTEMS; TREE STRUCTURES;

COMPUTER SCIENCE; COMPUTERS; FINITE AUTOMATA; FOUNDATIONS; TRANSLATION (LANGUAGES); TREES (MATHEMATICS);

GAME THEORY;

EID: 54249148995     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85238-4_17     Document Type: Conference Paper

References (20)

1. Bouajjani, A., Meyer, A.: Symbolic Reachability Analysis of Higher-Order Context-Free Processes. in: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 135-147. Springer, Heidelberg (2004)
2. Büchi, J.: Regular canonical systems. Arch. Math. Logik Grundlag. 6, 91-111 (1964)
3. Cachat, T.: Symbolic Strategy Synthesis for Games on Pushdown Graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) 1CALP 2002. LNCS, vol. 2380, pp. 704-715. Springer, Heidelberg (2002)
4. Cachat, T.: Higher-order-pushdown automata, the Caucal hierarchy of graphs and parity games. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) 1CALP 2003. LNCS, vol. 2719, pp. 556-569. Springer, Heidelberg (2003)
5. Cachat, T., Walukiewicz, L: The complexity of games on higher order pushdown automata. In: Electronic version (May 2007)
6. Carayol, A.: Regular Sets of Higher-Order Pushdown Stacks. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 168-179. Springer, Heidelberg (2005)
7. Carayol, A., Hague, M., Meyer, A., Ong, C.-H.L., Serre, O.: Winning regions of higher-order pushdown games. In: Proc. LICS 2008 (2008)
8. Carayol, A., Wohrle, S.: The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata,. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 112-123. Springer, Heidelberg (2003)
9. Caucal, D.: On Infinite Terms Having a Decidable Monadic Theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420. Springer, Heidelberg (2002)
10. Fratani, S.: Automates á piles de piles.. de piles. PhD thesis, Universit Bordeaux 1 (2005)
11. Knapik, T., Niwiński, D., Urzyczyn, P.: Higher-Order Pushdown Trees Are Easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303. Springer, Heidelberg (2002)
12. Serre, O.: Note on winning positions on pushdown games with omega-regular conditions. 1PL 85(6), 285-291 (2003)
13. Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, vol. 3, pp. 389-455. Springer, Heidelberg (1997)
14. Thomas, W.: Infinite Games and Verification. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, Springer, Heidelberg (2002)
15. Thomas, W.: Constructing Infinite Graphs with a Decidable MSO-Theory. In: Rovan, B., Vojtas, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 113-124. Springer, Heidelberg (2003)
16. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1-13. Springer, Heidelberg (2005)
17. Vardi, M.Y.: Reasoning about the Past with Two-Way Automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628-641. Springer, Heidelberg (1998)
18. Walukiewicz, I.: Pushdown processes: Games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 62-74. Springer, Heidelberg (1996)
19. Walukiewicz, I.: A landscape with games in the background. In: Proc. LICS 2004, pp. 356-366. IEE (2004)
20. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS 200, 135-183 (1998)