Abstract
The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also present improved memory bounds for randomized almost-sure winning and optimal strategies.
This research was supported in part by the the AFOSR MURI grant F49620-00-1-0327, and the NSF grant CCR-0225610.
Full proofs available in [2].
Chapter PDF
References
Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the AMS 138, 295–311 (1969)
Chatterjee, K.: The complexity of stochastic Müller games. Technical report: UC Berkeley, EECS-2006-141 (2006)
Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Trading memory for randomness. In: QEST’04, IEEE Computer Society Press, Los Alamitos (2004)
Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of stochastic Rabin and Streett games. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 878–890. Springer, Heidelberg (2005)
Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA’04, pp. 114–123. SIAM, Philadelphia (2004)
Condon, A.: The complexity of stochastic games. Information and Computation 96, 203–224 (1992)
Dziembowski, S., Jurdziński, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: LICS’97, pp. 99–110. IEEE Computer Society Press, Los Alamitos (1997)
de Alfaro, L., Henzinger, T.A.: Concurrent ω-regular games. In: LICS’00, pp. 141–154. IEEE Computer Society Press, Los Alamitos (2000)
Etessami, K., Yannakakis, M.: Recursive Markov decision processes and recursive stochastic games. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 891–903. Springer, Heidelberg (2005)
Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC’82, pp. 60–65. ACM Press, New York (1982)
Majumdar, R.: Symbolic algorithms for verification and control. PhD Thesis, UC Berkeley (2003)
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)
Martin, D.A.: The determinacy of Blackwell games. Journal of Symbolic Logic 63, 1565–1581 (1998)
McIver, A.K., Morgan, C.C.: Games, probability, and the quantitative μ-calculus qmμ. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, pp. 292–310. Springer, Heidelberg (2002)
Niwiński, D.: Fixed-point characterization of infinite behavior of finite-state systems. Theoretical Computer Science 189(1-2), 1–69 (1997)
Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization 25, 206–230 (1987)
Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, vol. 3: Beyond Words, pp. 389–455. Springer, Heidelberg (1997)
Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200(1-2), 135–183 (1998)
Zielonka, W.: Perfect-information stochastic parity games. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 499–513. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Chatterjee, K. (2007). Optimal Strategy Synthesis in Stochastic Müller Games . In: Seidl, H. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2007. Lecture Notes in Computer Science, vol 4423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71389-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-71389-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71388-3
Online ISBN: 978-3-540-71389-0
eBook Packages: Computer ScienceComputer Science (R0)