Stratifying Winning Positions in Parity Games
Parity games have attracted considerable attentions for at least two reasons. First, the problem of deciding wining positions in parity games is equivalent to the problem of μ-calculus model checking. Second, parity games are the simplest in a chain of two-player games which are known in NP ∩ co-NP but so far no efficient algorithms have been found.
Unable to display preview. Download preview PDF.