Pushdown games with unboundedness and regular conditions

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

Volumn 2914, Issue , 2003, Pages 88-99

  Bouquet, Alexis Julien ^a   Serre, Oliver ^b   Walukiewicz, Igor ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BOOLEAN COMBINATIONS; EXPTIME; INFINITARY; PERFECT INFORMATIONS; PUSH-DOWN AUTOMATA; PUSHDOWN GAMES; WINNING CONDITIONS;

SOFTWARE ENGINEERING;

EID: 24044437255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_8     Document Type: Article

References (20)

1. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controllers with partial observation. Theoretical Computer Science, 303(1):7-34, 2003.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR'97, volume 1243 of Lecture Notes in Computer Science, pages 135-150, 1997.
3. A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with the unboundedness and regular conditions: full version with complete proofs. http://www.labri.fr/∼igw/publications.html.
4. T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 704-715. Springer Verlag, 2002.
5. T. Cachat. Uniform solution of parity games on prefix-recognizable graphs. In A. Kucera and R. Mayr, editors, Proceedings of the 4th International Workshop on Verification of Infinite-State Systems, volume 68 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002.
6. T. Cachat, J. Duparc, and W. Thomas. Solving pushdown games with a sigma-3 winning condition. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002, volume 2471 of Lecture Notes in Computer Science, pages 322-336, 2002.
7. E. Emerson, C. Jutla, and A. Sistla. On model-checking for the mu-calculus and its fragments. Theoretical Computer Science, 258(1-2):491-522, 2001.
8. E. A. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments of μ-calculus. In CAV'93, volume 697 of LNCS, pages 385-396, 1993.
9. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOCS 91, pages 368-377, 1991.
10. J. Esparza and A. Podelski. Efficient algorithms for pre star and post star on interprocedural parallel flow graphs. In POPL'00: Principles of Programming Languages, 2000.
11. O. Kupferman and M. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In Proceedings of CAV'00, volume 1855 of Lecture Notes in Computer Science, pages 36-52. Springer Verlag, 2000.
12. D. Muller and P. Schupp. The theory of ends, pushdown automata and second-order logic. Theoretical Computer Science, 37:51-75, 1985.
13. D. Muller and P. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267-276, 1987.
14. O. Serre. Note on winning positions on pushdown games with ω-regular conditions. Information Processing Letters, 85:285-291, 2003.
15. W. Thomas. Automata on infinite objects. In J. van Leeuven, editor, Handbook of Theoretical Computer Science Vol.B, pages 133-192. Elsevier, 1990.
16. W. Thomas. On the synthesis of strategies in infinite games. In STACS '95, volume 900 of Lecture Notes in Computer Science, pages 1-13, 1995.
17. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3. Springer-Verlag, 1997.
18. I. Walukiewicz. Pushdown processes: Cames and model checking. In CAV'96, volume 1102 of Lecture Notes in Computer Science, pages 62-74, 1996. Full version to appear in Information and Computation.
19. I. Walukiewicz. Pushdown processes: Games and model checking. Information and Computation, 164(2):234-263, 2001.
20. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200:135-183, 1998.