Higher order pushdown automata, the Caucal hierarchy of graphs and parity games

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

Volumn 2719, Issue , 2003, Pages 556-569

  Cachat, Thierry ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GAME THEORY;

EFFECTIVE SOLUTION; HIGHER-ORDER; PARITY GAMES; PUSH-DOWN AUTOMATA; TRANSITION GRAPHS; WINNING STRATEGY;

MODEL CHECKING;

EID: 35248854247     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_45     Document Type: Article

References (21)

1. T. CACHAT, Symbolic strategy synthesis for games on pushdown graphs, ICALP'02, LNCS 2380, pp. 704-715, 2002.
2. T. CACHAT, Uniform solution of parity games on prefix-recognizable graphs, INFINITY 2002, ENTCS 68(6), 2002.
3. T. CACHAT, Two-way tree automata solving pushdown games, ch. 17 in [11].
4. D. CAUCAL, On infinite transition graphs having a decidable monadic theory, ICALP'96, LNCS 1099, pp. 194-205, 1996.
5. D. CAUCAL, On infinite terms having a decidable monadic theory, MFCS'02, LNCS 2420, pp. 165-176, 2002.
6. D. CAUCAL, O. BURKART, F. MOLLER AND B. STEFFEN, Verification on infinite structures, Handbook of process algebra, Ch. 9, pp. 545-623, Elsevier, 2001.
7. B. COURCELLE AND I. WALUKIEWICZ, Monadic second-order logic, graph converings and unfoldings of transition systems, Annals of Pure and Applied Logic 92-1, pp. 35-62, 1998.
8. E. A. EMERSON AND C. S. JUTLA, Tree automata, mu-calculus and determinacy, FoCS'91, IEEE Computer Society Press, pp. 368-377, 1991.
9. J. ENGELFRIET, Iterated push-down automata, 15th STOC, pp. 365-373, 1983.
10. J. ESPARZA, D. HANSEL, P. ROSSMANITH AND S. SCHWOON, Efficient algorithm for model checking pushdown systems, Technische Universität München, 2000.
11. E. GRÄDEL, W. THOMAS AND T. WILKE eds., Automata, Logics, and Infinite Games, A Guide to Current Research, LNCS 2500, 2002.
12. E. GRÄDEL AND I. WALUKIEWICZ, Guarded fixed point logic, LICS '99, IEEE Computer Society Press, pp. 45-54, 1999.
13. T. KNAPIK, D. NIWINSKI AND P. URZYCZYN Higher-order pushdown trees are easy, FoSSaCS'02, LNCS 2303, pp. 205-222, 2002.
14. O. KUPFERMAN, M. Y. VARDI AND N. PITERMAN, Model checking linear properties of prefix-recognizable systems, CAV'02, LNCS 2404, pp. 371-385.
15. O. KUPFERMAN AND M. Y. VARDI, An automata-theoretic approach to reasoning about infinite-state systems, CAV'00, LNCS 1855, 2000.
16. W. THOMAS, Languages, Automata, and Logic, Handbook of formal language theory, vol. III, pp. 389-455, Springer-Verlag, 1997.
17. M. Y. VARDI, Reasoning about the past with two-way automata., ICALP'98, LNCS 1443, pp. 628-641, 1998.
18. I. WALUKIEWICZ, Pushdown processes: games and model checking, CAV'96, LNCS 1102, pp. 62-74, 1996.
19. Full version in Information and Computation 164, pp. 234-263, 2001.
20. I. WALUKIEWICZ, Monadic second order logic on tree-like structures, STACS'96, LNCS 1046, pp. 401-114.
21. Full version in TCS 275 (2002), no. 1-2, pp. 311-346.