Abstract
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.
Supported by National Natural Science Foundation of China (Grant No. 60721061).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, H. (2008). Stratifying Winning Positions in Parity Games. In: van Hee, K.M., Valk, R. (eds) Applications and Theory of Petri Nets. PETRI NETS 2008. Lecture Notes in Computer Science, vol 5062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68746-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-68746-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68745-0
Online ISBN: 978-3-540-68746-7
eBook Packages: Computer ScienceComputer Science (R0)