"Information and Computation" . . . "RIV/00216224:14330/13:00065989!RIV14-MSM-14330___" . "10.1016/j.ic.2013.01.001" . . . "RIV/00216224:14330/13:00065989" . "Forejt, Vojt\u011Bch" . "Kr\u010D\u00E1l, Jan" . "25"^^ . "Ku\u010Dera, Anton\u00EDn" . "NL - Nizozemsko" . "Continuous-Time Stochastic Games with Time-Bounded Reachability" . "P(GAP202/10/1469), S" . . . "14330" . "000315361200003" . "continuous time stochastic systems; time-bounded reachability; stochastic games"@en . "Continuous-Time Stochastic Games with Time-Bounded Reachability"@en . . . "Br\u00E1zdil, Tom\u00E1\u0161" . "0890-5401" . "Continuous-Time Stochastic Games with Time-Bounded Reachability" . . "We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute epsilon-optimal strategies in finite games and provide detailed complexity estimations. Moreover, we show how to compute epsilon-optimal strategies in infinite games with finite branching and bounded rates where the bound as well as the successors of a given state are effectively computable. Finally, we show how to compute optimal strategies in finite uniform games." . . . "[01D2AAA110F8]" . "K\u0159et\u00EDnsk\u00FD, Jan" . "224" . "66901" . . . "Continuous-Time Stochastic Games with Time-Bounded Reachability"@en . . "5"^^ . . "We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute epsilon-optimal strategies in finite games and provide detailed complexity estimations. Moreover, we show how to compute epsilon-optimal strategies in infinite games with finite branching and bounded rates where the bound as well as the successors of a given state are effectively computable. Finally, we show how to compute optimal strategies in finite uniform games."@en . . . . . . "1" . "5"^^ . .