Polynomial-Time Under-Approximation of Winning Regions in Parity Games

@article{Antonik2009PolynomialTimeUO,
  title={Polynomial-Time Under-Approximation of Winning Regions in Parity Games},
  author={Adam Antonik and Nathaniel Charlton and Michael Huth},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2009},
  volume={225},
  pages={115-139}
}

• Adam Antonik, Nathaniel Charlton, Michael Huth
• Published 2009 in Electr. Notes Theor. Comput. Sci.
• DOI:10.1016/j.entcs.2008.12.070

We propose a pattern for designing algorithms that run in polynomial time by construction and underapproximate the winning regions of both players in parity games. This approximation is achieved by the interaction of finitely many aspects governed by a common ranking function, where the choice of aspects and ranking function instantiates the design pattern. Each aspect attempts to improve the under-approximation of winning regions or decrease the rank function by simplifying the structure of… CONTINUE READING

View via Publisher

Alternate Sources

Add to Library

Create Alert

Cite