Optimal strategy synthesis in stochastic Müller games
Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol. 4423, 138–152.
Download
No fulltext has been uploaded. References only!
Conference Paper
| Published
Author
Series Title
LNCS
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.
Publishing Year
Date Published
2007-07-02
Publisher
Springer
Acknowledgement
This research was supported in part by the the AFOSR MURI grant F49620-00-1- 0327, and the NSF grant CCR-0225610.
Volume
4423
Page
138 - 152
Conference
FoSSaCS: Foundations of Software Science and Computation Structures
IST-REx-ID
Cite this
Chatterjee K. Optimal strategy synthesis in stochastic Müller games. In: Vol 4423. Springer; 2007:138-152. doi:10.1007/978-3-540-71389-0_11
Chatterjee, K. (2007). Optimal strategy synthesis in stochastic Müller games (Vol. 4423, pp. 138–152). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. https://doi.org/10.1007/978-3-540-71389-0_11
Chatterjee, Krishnendu. “Optimal Strategy Synthesis in Stochastic Müller Games,” 4423:138–52. Springer, 2007. https://doi.org/10.1007/978-3-540-71389-0_11.
K. Chatterjee, “Optimal strategy synthesis in stochastic Müller games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007, vol. 4423, pp. 138–152.
Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol. 4423, 138–152.
Chatterjee, Krishnendu. Optimal Strategy Synthesis in Stochastic Müller Games. Vol. 4423, Springer, 2007, pp. 138–52, doi:10.1007/978-3-540-71389-0_11.
Google Scholar