Game Development Reference
In-Depth Information
C. Baier, N. Bertrand, and P. Schnoebelen. Verifying nondeterministic probabilistic
channel systems against ω -regular linear-time properties. ACM Transactions
on Computational Logic , 9(1), 2007.
A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic
systems. In Proceedings of FST&TCS'95 , volume 1026 of Lecture Notes in
Computer Science , pages 499-513. Springer, 1995.
P. Billingsley. Probability and Measure . Wiley, Hoboken, New Jersey, 1995.
T. Brazdil and V. Forejt. Strategy synthesis for Markov decision processes and
branching-time logics. In Proceedings of CONCUR 2007 , volume 4703 of Lecture
Notes in Computer Science , pages 428-444. Springer, 2007.
T. Brazdil, V. Brozek, V. Forejt, and A. Kucera. Stochastic games with branching-
time winning objectives. In Proceedings of LICS 2006 , pages 349-358. IEEE
Computer Society Press, 2006.
T. Brazdil, V. Brozek, V. Forejt, and A. Kucera. Reachability in recursive Markov
decision processes. Information and Computation , 206(5):520-537, 2008.
T. Brazdil, V. Forejt, J. Kretınsky, and A. Kucera. The satisfiability problem
for probabilistic CTL. In Proceedings of LICS 2008 , pages 391-402. IEEE
Computer Society Press, 2008.
T. Brazdil, V. Forejt, and A. Kucera. Controller synthesis and verification for Markov
decision processes with qualitative branching time objectives. In Proceedings
of ICALP 2008, Part II , volume 5126 of Lecture Notes in Computer Science ,
pages 148-159. Springer, 2008.
T. Brazdil, V. Brozek, A. Kucera, and J. Obdrzalek. Qualitative reachability in
stochastic BPA games. In Proceedings of STACS 2009 , volume 3 of Leibniz Inter-
national Proceedings in Informatics , pages 207-218. Schloss Dagstuhl-Leibniz-
Zentrum fur Informatik, 2009a. A full version is available at arXiv:1003.0118
[cs.GT].
T. Brazdil, V. Forejt, J. Krcal, J. Kretınsky, and A. Kucera. Continuous-time
stochastic games with time-bounded reachability. In Proceedings of FST&TCS
2009 , volume 4 of Leibniz International Proceedings in Informatics , pages 61-72.
Schloss Dagstuhl-Leibniz-Zentrum fur Informatik, 2009b.
T. Brazdil, V. Brozek, K. Etessami, A. Kucera, and D. Wojtczak. One-counter
Markov decision processes. In Proceedings of SODA 2010 , pages 863-874.
SIAM, 2010.
V. Brozek. Basic Model Checking Problems for Stochastic Games . PhD thesis,
Masaryk University, Faculty of Informatics, 2009.
K. Chatterjee. Stochastic ω-regular Games . PhD thesis, University of California,
Berkeley, 2007.
K. Chatterjee, M. Jurdzinski, and T. Henzinger. Simple stochastic parity games.
In Proceedings of CSL'93 , volume 832 of Lecture Notes in Computer Science ,
pages 100-113. Springer, 1994.
K. Chatterjee, L. de Alfaro, and T. Henzinger. Trading memory for randomness. In
Proceedings of 2nd Int. Conf. on Quantitative Evaluation of Systems (QEST'04) ,
pages 206-217. IEEE Computer Society Press, 2004a.
K. Chatterjee, M. Jurdzinski, and T. Henzinger. Quantitative stochastic parity
games. In Proceedings of SODA 2004 , pages 121-130. SIAM, 2004b.
K. Chatterjee, R. Majumdar, and M. Jurdzinski. On Nash equilibria in stochastic
games. In Proceedings of CSL 2004 , volume 3210 of Lecture Notes in Computer
Science , pages 26-40. Springer, 2004c.
Search Nedrilad ::




Custom Search