Qualitative reachability in stochastic bpa games

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 207-218

  Brázdil, Tomáš ^a   Brožek, Vacláv ^b   Kučera, Antonín ^b   Obdržálek, Jan ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Pushdown automata; Reachability; Stochastic games

Indexed keywords

FINITE-STATE AUTOMATA; PROBABILITY CONSTRAINTS; PUSH-DOWN AUTOMATA; REACHABILITY; RECURSIVE STATE MACHINES; STOCHASTIC GAME; TARGET CONFIGURATIONS; WINNING STRATEGY;

COMPUTER SCIENCE; GAME THEORY;

AUTOMATA THEORY;

EID: 84880198420     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. P. Abdulla, N.B. Henda, L. de Alfaro, R. Mayr, and S. Sandberg. Stochastic games with lossy channels. In Proceedings of FoSSaCS 2008, volume 4962 of LNCS, pages 35-49. Springer, 2008.
2. C. Baier, N. Bertrand, and Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. on Comp. Logic, 9(1), 2007.
3. T. Brázdil, V. Brožek, A. Kučera, and J. Obdržálek. Qualitative reachability in stochastic BPA games. Technical report FIMU-RS-2009-01, Faculty of Informatics, Masaryk University, 2009.
4. T. Brázdil, V. Brožek, V. Forejt, and A. Kučera. Reachability in recursive Markov decision processes. In Proceedings of CONCUR 2006, volume 4137 of LNCS, pages 358-374. Springer, 2006.
5. T. Brázdil, V. Brožek, V. Forejt, and A. Kučera. Reachability in recursive Markov decision processes. I&C, 206(5):520-537, 2008.
6. K. Chatterjee, L. de Alfaro, and T. Henzinger. The complexity of stochastic Rabin and Streett games. In Proceedings of ICALP 2005, volume 3580 of LNCS, pages 878-890. Springer, 2005.
7. K. Chatterjee, M. Jurdziński, and T. Henzinger. Simple stochastic parity games. In Proceedings of CSL'93, volume 832 of LNCS, pages 100-113. Springer, 1994.
8. K. Chatterjee, M. Jurdziński, and T. Henzinger. Quantitative stochastic parity games. In Proceedings of SODA 2004, pages 121-130. SIAM, 2004.
9. A. Condon. The complexity of stochastic games. I&C, 96(2):203-224, 1992.
10. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. JCSS, 68:374-397, 2004.
11. J. Esparza, A. Kučera, and S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. I&C, 186(2):355-376, 2003.
12. K. Etessami, D. Wojtczak, and M. Yannakakis. Recursive stochastic games with positive rewards. In Proceedings of ICALP 2008, Part I, volume 5125 of LNCS, pages 711-723. Springer, 2008.
13. K. Etessami and M. Yannakakis. Recursive Markov decision processes and recursive stochastic games. In Proceedings of ICALP 2005, volume 3580 of LNCS, pages 891-903. Springer, 2005.
14. K. Etessami and M. Yannakakis. Efficient qualitative analysis of classes of recursive Markov decision processes and simple stochastic games. In Proceedings of STACS 2006, volume 3884 of LNCS, pages 634-645. Springer, 2006.
15. K. Etessami and M. Yannakakis. Recursive concurrent stochastic games. In Proceedings of ICALP 2006, volume 4052 of LNCS, pages 324-335. Springer, 2006.
16. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
17. A. Maitra and W. Sudderth. Finitely additive stochastic games with Borel measurable payoffs. Int. Jour. of Game Theory, 27:257-267, 1998.
18. D.A. Martin. The determinacy of blackwell games. Journal of Symbolic Logic, 63(4):1565-1581, 1998.
19. W. Thomas. Infinite games and verification. In Proceedings of CAV 2003, volume 2725 of LNCS, pages 58-64. Springer, 2003.
20. N. Vieille. Stochastic games: Recent results. Handbook of Game Theory, pages 1833-1850, 2002.
21. I. Walukiewicz. A landscape with games in the background. In Proceedings of LICS 2004, pages 356-366. IEEE, 2004.