We consider stochastic turn-based games where the winning objectives are given by formulae of the branching-time logic PCTL. These games are generally not determined and winning strategies may require memory and/or randomization. Our main results concern history-dependent strategies.
Citation:
Tomas Brazdil, Vaclav Bro?zek, Vojtech Forejt, Antonin Kucera, "Stochastic Games with Branching-Time Winning Objectives," lics, pp.349-358, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006