Symbolic strategy synthesis for games on pushdown graphs

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

Volumn 2380 LNCS, Issue , 2002, Pages 704-715

  Cachat, Thierry ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY;

AUTOMATA-THEORETIC APPROACH; CONSTANT TIME; INFINITE TWO-PLAYER GAME; PUSHDOWN; PUSHDOWN GRAPHS; REACHABILITY; STRATEGY SYNTHESIS; WINNING STRATEGY;

AUTOMATA THEORY;

EID: 84869180618     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_60     Document Type: Conference Paper

References (13)

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. A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith, B. Willems, and P. Wolper, An efficient automata approach to some problems on context-free grammars, Information Processing Letters, Vol 74, 2000.
3. D. Caucal, On the regular structure of prefix rewriting, CAAP '90, LNCS 431, pp. 87-102, 1990.
4. O. Corolleur, Etude de jeux sur les graphes de transitions des automates à pile, Rapport de stage d'option informatique, Ecole Polytechnique, 2001.
5. E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, FoCS '91, IEEE Computer Society Press, pp. 368-377, 1991.
6. E. A. Emerson, C. S. Jutla, and A. P. Sistla, On model-checking for fragments of μ-calculus, CAV '93, LNCS 697, pp. 385-396, 1993.
7. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon, Efficient Algorithm for Model Checking Pushdown Systems, Technische Universität München, 2000.
8. O. Kupferman and M. Y. Vardi, An Automata-Theoretic Approach to Reasoning about Infinite-State Systems, CAV 2000, LNCS 1855, 2000.
9. O. Kupferman and M. Y. Vardi, Weak Alternating Automata Are Not That Weak, ISTCS'97, IEEE Computer Society Press, 1997.
10. C. Löding and W. Thomas, Alternating Automata and Logics over Infinite Words, IFIP TCS '00, LNCS 1872, pp. 521-535, 2000.
11. W. Thomas, On the synthesis of strategies in infinite games, STACS '95, LNCS 900, pp. 1-13, 1995.
12. I. Walukiewicz, Pushdown processes: games and model checking, CAV'96, LNCS 1102, pp 62-74, 1996.
13. Full version in Information and Computation 157, 2000.