Note on winning positions on pushdown games with ω-regular conditions

Information Processing Letters

Volumn 85, Issue 6, 2003, Pages 285-291

  Serre, Olivier ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Automata; Games; Infinite graphs; Pushdown processes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

PUSHDOWN GAMES;

AUTOMATA THEORY;

EID: 0037475068     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00445-3     Document Type: Article

References (12)

1. Cachat T. Uniform solution of parity games on prefix-recognizable graphs. To appear in ENTCS http://www-i7.informatik.rwth-aachen.de/̃cachat.
2. Cachat T. Symbolic strategy synthesis for games on pushdown graphs. Proceedings of ICALP'02. Lecture Notes in Computer Science. 2380:2002;704-715 Springer, Berlin.
3. Chandra K., Kozen D., Stockmeyer J. Alternation. J. ACM. 28:(1):1981;114-133.
4. Emerson E.A., Jutla C.S. Tree automata, mu-calculus and determinacy (extended abstract). IEEE Symposium on Foundations of Computer Science (FOCS). 1991;368-377.
5. Esparza J., Hansel D., Rossmanith P., Schwoon S. Efficient algorithms for model checking pushdown systems. Proceedings of CAV'00. Lecture Notes in Computer Science. 1855:2000;232-247 Springer, Berlin.
6. Kupferman O., Vardi M.Y. An automata-theoretic approach to reasoning about infinite-state systems. Proceedings of CAV'00. Lecture Notes in Computer Science. 1855:2000;36-52 Springer, Berlin.
7. McNaughton R. Infinite games played on finite graphs. Ann. Pure Appl. Logic. 65:1993;149-184.
8. Mostowski A.W. Regular expressions for infinite trees and a standard form for automata. Computation Theory. Lecture Notes in Computer Science. 208:1984;157-168 Springer, Berlin.
9. Muller D., Schupp P. The theory of ends, pushdown automata, and second-order logic. Theoret. Comput. Sci. 37:1985;51-75.
10. Thomas W. On the synthesis of strategies in infinite games. Proceedings of STACS'95. Lecture Notes in Computer Science. 900:1995;1-13 Springer, Berlin.
11. Walukiewicz I. Pushdown processes: games and model checking. Inform. and Comput. 164:2001;234-263.
12. Zielonka W. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoret. Comput. Sci. 200:(1-2):1998;135-183.