Sciweavers

800 search results - page 5 / 160
» On the Complexity of Parity Games
Sort
View
LICS
2005
IEEE
15 years 4 months ago
Mean-Payoff Parity Games
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...
CSL
2002
Springer
14 years 11 months ago
Trading Probability for Fairness
d Abstract) Marcin Jurdzi
Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzi...
FOSSACS
2006
Springer
15 years 2 months ago
Parity Games Played on Transition Graphs of One-Counter Processes
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
Olivier Serre
ENTCS
2002
110views more  ENTCS 2002»
14 years 11 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat
ITA
2007
14 years 11 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange