Simple Stochastic Parity Games

12 years 4 months ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in the graph. The focus here is on simple stochastic parity games, that is, two-player games with turn-based probabilistic transitions and ω-regular objectives formalized as parity (Rabin chain) winning conditions. An efficient translation from simple stochastic parity games to nonstochastic parity games is given. As many algorithms are known for solving the latter, the translation yields efficient algorithms for computing the states of a simple stochastic parity
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where CSL
Authors Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger
Comments (0)