Parity games played on transition graphs of one-counter processes

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

Volumn 3921 LNCS, Issue , 2006, Pages 337-351

  Serre, Olivier ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULUS MODEL CHECKING; PARITY GAMES; PUSHDOWN GRAPHS;

COMPUTATIONAL COMPLEXITY; DIFFERENTIATION (CALCULUS); GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES;

GAME THEORY;

EID: 33745790034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_23     Document Type: Conference Paper

References (26)

1. A. Arnold and D. Niwiński. Rudiments of mu-calculus, volume 146 of Studies in Logic and the Foundations of Mathematics. Elsevier, 2001.
2. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controlers with partial observation. Theoretical Computer Science, 303(1):7-34, 2003.
3. A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with the unboundedness and regular conditions. In Proceedings of FST&TCS'03, volume 2914 of LNCS, pages 88-99. Springer, 2003.
4. T. Cachat. Two-way tree automata solving pushdown games. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logics, and Infinite Games, volume 2500 of LNCS, pages 303-317. Springer, 2002.
5. 3-winning condition. In Proceedings of CSL'02, volume 2471 of LNCS, pages 322-336. Springer, 2002.
6. E. A. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments of mucalculus. In Proceedings of CAV'93, volume 697 of LNCS, pages 385-396. Springer, 1993.
7. H. Gimbert. Parity and exploration games on infinite graphs. In Springer, editor, Proceedings of CSL'04, volume 3210 of LNCS, pages 56-70, 2004.
8. P. Jančar, A. Kučera, F. Moller, and Zdeněk Sawa. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation, 188:1-19, 2004.
9. A. Kucera. Efficient verification algorithms for one-counter processes. In Springer, editor, Proceedings of ICALP'00, volume 1853 of LNCS, pages 317-328, 2000.
10. O. Kupferman, N. Piterman, and M. Vardi. Extended temporal logic revisited. In Springer, editor, Proceedings of Concur'01, volume 2154 of LNCS, pages 519-535, 2001.
11. O. Kupferman and M. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In Proceedings of CAV'00, volume 1855 of LNCS, pages 36-52. Springer, 2000.
12. O. Kupferman and M. Vardi. Weak alternating automata are not that weak. ACM Transactions on Computational Logic, 2(3):408-429, 2001.
13. C. L-Sep-oding. Methods for the transformation of ω-automata: Complexity and connection to second order logic. Diplomata thesis, Christian-Albrechts-University of Kiel, 1998.
14. C. Löding, P. Madhusudan, and O. Serre. Visibly pushdown games. In Proceedings of FST&TCS'04, volume 3328 of LNCS, pages 408-420. Springer, 2004.
15. D. A. Martin. Borel determinacy. Annals of Mathematics, 102(363-371), 1975.
16. C. Papadimitriou. Complexity Theory. Addison Wesley, 1994.
17. N. Piterman. Extending temporal logic with ω-automata. Master's thesis, The Weizmann Institute of Science, 2000.
18. O. Serre. Contribution à l'étude des jeux sur des graphe de processus à pile. PhD thesis, Université Paris VII, November 2004.
19. O. Serre. Games with winning conditions of high Borel complexity. In Proceedings of ICALP'04, volume 3142 of LNCS, pages 1150-1162. Springer, 2004.
20. O. Serre. Parity games played on transition graphs of one-counter processes: full version with complete proofs, http://www.liafa.jussieu.fr/~serre
21. W. Thomas. On the synthesis of strategies in infinite games. In Proceedings of STACS 1995, volume 900 of LNCS, pages 1-13. Springer, 1995.
22. M. Vardi. Reasoning about the past with two-way automata. In Proceedings of ICALP 1998, volume 1443 of LNCS, pages 628-641. Springer, 1998.
23. I. Walukiewicz. Pushdown processes: games and model checking. In Proceedings of CAV'96, volume 1102 of LNCS, pages 62-74. Springer, 1996.
24. I. Walukiewicz. Pushdown processes: games and model checking. Information and Computation, 157:234-263, 2000.
25. I. Walukiewicz. A landscape with games in the background. In Proceeding of LICS'04, pages 356-366. IEEE Computer Society, 2004.
26. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200(1-2).-135-183, 1998.