Stratifying Winning Positions in Parity Games

  • Huimin Lin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5062)


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.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Huimin Lin
    • 1
  1. 1.Laboratory of Computer Science Institute of SoftwareChinese Academy of Sciences 

Personalised recommendations