Stochastic Games with Branching-Time Winning Objectives
Tomǎš Brázdil, V. Bro zek, Vojtěch Forejt, Antonı́n Kučera · 2006
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.