Stochastic game logic

Proceedings - 4th International Conference on the Quantitative Evaluation of Systems, QEST 2007

Volumn , Issue , 2007, Pages 227-236

  Baier, Christel ^a   Brázdil, Tomáš ^b   Größer, Marcus ^a   Kučera, Antonín ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; INFORMATION THEORY; MODEL CHECKING;

ALTERNATING TEMPORAL LOGICS; BRANCHING TIMES; EXTENDED TEMPORAL LOGICS; MULTIPLAYER GAMES; PROBABILISTIC COMPUTATIONS; RANDOMIZED STRATEGIES; STOCHASTIC GAMES; UPPER BOUNDS;

TEMPORAL LOGIC;

EID: 47949094080     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2007.45     Document Type: Conference Paper

References (18)

1. Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. Journal of the ACM, 49:672-713, 2002.
2. C. Baier, M. Größer, M. Leucker, F. Ciesinski, and B. Bollig. Controller synthesis for probabilistic systems. In IFIP Worldcongress, Theoretical Computer Science, 2004.
3. Michael Ben-Or, Dexter Kozen, and John Reif. The complexity of elementary algebra and geometry. J. Comput. Syst. Sci., 32(2):251-264, 1986.
4. Bianco and de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. FSTTCS, volume 15 of Lecture Notes in Computer Science, pages 499-513,1995.
5. Tomáš Brázdil, Václav Brožek, Vojtěch Forejt, and Antonín Kučera. Stochastic games with branching-time winning objectives. In Proc. LICS. IEEE Computer Society Press (to appear), 2006.
6. Edmund M. Clarke, Orna Grumberg, and Robert P. Kurshan. A synthesis of two approaches for verifying finite state concurrent systems. J. Log. Comput., 2(5):605-618,1992.
7. Costas Courcoubetis and Mihalis Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, July 1995.
8. Luca de Alfaro. Formal verification of probabilistic systems. Thesis CS-TR-98-1601, Stanford University, Department of Computer Science, June 1998.
9. Luca de Alfaro and Thomas A. Henzinger. Concurrent omega-regular games. In Proc. LICS, pages 141-154, 2000.
10. Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent reachability games. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 564-575, 1998.
11. Sergiu Hart, Micha Shark, and Amir Pnueli. Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(3):356-380, July 1983.
12. Antoní Kučera and Oldřich Stražovský. On the controller synthesis for finite-state Markov decision processes. In Proc. FSTTCS, volume 3821 of Lecture Notes in Computer Science, pages 541-552, 2005.
13. Shmuel Safra. On the complexity of ω-automata. In 29th Annual Symposium on Foundations of Computer Science, pages 319-327, White Plains, New York, 24-26 October 1988. IEEE.
14. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Lecture Notes in Computer Science, 836:481-496, 1994.
15. Wolfgang Thomas. Computation tree logic and regular omega-languages. Lecture Notes in Computer Science, 354:690-713, 1988.
16. Wolfgang Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133-191. Elsevier Science Publishers B. V., 1990.
17. Moshe Y Vardi. Probabilistic linear-time model checking: An overview of the automata-theoretic approach. Lecture Notes in Computer Science, 1601:265-276, 1999.
18. Moshe Y Vardi and Pierre Wolper. Yet another process logic (preliminary version). Lecture Notes in Computer Science, 164:501-512, 1983.