Stochastic games with branching-time winning Objectives

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 349-358

  Brázdil, Tomáš ^a   Brožek, Václav ^a   Forejt, Vojtěch ^a   Kučera, Antonín ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

BRANCHING TIME LOGIC; RANDOMIZATION; STOCHASTIC GAMES; WINNING STRATEGIES;

GAME THEORY;

EID: 34547364464     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.48     Document Type: Conference Paper

References (16)

1. C. Baier, M. Größer, M. Leucker, B. Bollig, and F. Ciesinski. Controller synthesis for probabilistic systems. In Proceedings of IFIP TCS'2004. KIuwer, 2004.
2. T. Brázdil, V. Brožek, V. Forejt, and A. Kučera. Stochastic games with branching-time winning objectives. Technical report FIMU-RS-2006-02, Faculty of Informatics, Masaryk University, 2006.
3. T. Brázdil, J. Esparza, and A. Kuečera. Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion. In Proceedings of FOCS 2005, pp. 521-530. IEEE, 2005.
4. T. Brázdil, A. Kučera, and O. Stražovský. On the decidability of temporal properties of probabilistic pushdown automata. In Proceedings of STACS'2005, vol. 3404 of LNCS, pp. 145-157. Springer, 2005.
5. K. Chatterjee, L. de Alfaro, and T. Henzinger. The complexity of stochastic Rabin and Streett games. In Proceedings of ICALP 2005, vol. 3580 of LNCS, pp. 878-890. Springer, 2005.
6. K. Chatterjee and T. Henzinger. Semiperfect-information games. In Proceedings of FST&TCS 2005, vol. 3821 of LNCS, pp. 1-18. Springer, 2005.
7. K. Chatterjee, M. Jurdzinski, and T. Henzinger. Simple stochastic parity games. In Proceedings of CSL'93, vol. 832 of LNCS, pp. 100-113. Springer, 1994.
8. K. Chatterjee, M. Jurdzinski, and T. Henzinger. Quantitative stochastic parity games. In Proceedings of SODA 2004, pp. 121-130. SIAM, 2004.
9. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. JCSS, 68:374-397, 2004.
10. J. Esparza, A. Kučera, and R. Mayr. Model-checking probabilistic pushdown automata. In Proceedings of LICS 2004, pp. 12-21. IEEE, 2004.
11. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. In Proceedings of STACS'2005, vol. 3404 of LNCS, pp. 340-352. Springer, 2005.
12. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512-535, 1994.
13. David Harel. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. J. ACM, 33(1):224-248, 1986.
14. A. Kučera and O. Stražovský. On the controller synthesis for finite-state Markov decision processes. In Proceedings of FST&TCS 2005, vol. 3821 of LNCS, pp. 541-552. Springer, 2005.
15. Ch. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
16. W. Thomas. Infinite games and verification. In Proceedings of CAV 2003, vol. 2725 of LNCS, pp. 58-64. Springer, 2003.