Sciweavers

155 search results - page 4 / 31
» Energy Parity Games
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
13 years 7 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
TACAS
2009
Springer
157views Algorithms» more  TACAS 2009»
14 years 25 days ago
Alpaga: A Tool for Solving Parity Games with Imperfect Information
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs...
Dietmar Berwanger, Krishnendu Chatterjee, Martin D...
FSTTCS
2008
Springer
13 years 7 months ago
On the Power of Imperfect Information
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...
Dietmar Berwanger, Laurent Doyen
CSL
2007
Springer
14 years 7 days ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek
CAV
2007
Springer
157views Hardware» more  CAV 2007»
14 years 7 days ago
An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
Luca de Alfaro, Marco Faella