@inproceedings{4543,
abstract = {The synthesis of a reactive system with respect to all omega-regular specification requires the solution of a graph game. Such games have been extended in two natural ways. First, a game graph can be equipped with probabilistic choices between alternative transitions, thus allowing the, modeling of uncertain behaviour. These are called stochastic games. Second, a liveness specification can he strengthened to require satisfaction within all unknown but bounded amount of time. These are called finitary objectives. We study. for the first time, the, combination of Stochastic games and finitary objectives. We characterize the requirements on optimal strategies and provide algorithms for Computing the maximal achievable probability of winning stochastic games with finitary parity or Street, objectives. Most notably the set of state's from which a player can win with probability . for a finitary parity objective can he computed in polynomial time even though no polynomial-time algorithm is known in the nonfinitary case.},
author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Horn, Florian},
location = {High Tatras, Slovakia},
pages = {34 -- 54},
publisher = {Springer},
title = {{Stochastic games with finitary objectives}},
doi = {10.1007/978-3-642-03816-7_4},
volume = {5734},
year = {2009},
}