Sciweavers

Share
72 search results - page 1 / 15
» Clique-Width and Parity Games
Sort
View
CSL
2007
Springer
8 years 10 months 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
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
8 years 11 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
TACAS
2009
Springer
157views Algorithms» more  TACAS 2009»
8 years 11 months 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...
ICALP
2010
Springer
8 years 8 months ago
Energy Parity Games
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
Krishnendu Chatterjee, Laurent Doyen
IPL
2008
110views more  IPL 2008»
8 years 4 months ago
Reduction of stochastic parity to stochastic mean-payoff games
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
Krishnendu Chatterjee, Thomas A. Henzinger
books