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

  • Authors:

  • Adam Antonik;Nathaniel Charlton;Michael Huth

  • Affiliations:

  • Department of Computing, South Kensington campus, Imperial College London, London, SW7 2AZ, United Kingdom;Department of Computing, South Kensington campus, Imperial College London, London, SW7 2AZ, United Kingdom;Department of Computing, South Kensington campus, Imperial College London, London, SW7 2AZ, United Kingdom

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a pattern for designing algorithms that run in polynomial time by construction and under-approximate 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 the parity game. Our design pattern is incremental as aspects may operate on the residual game of yet undecided nodes. We present several aspects and one higher-order transformation of our algorithms - based on efficient, static analyses - and illustrate the benefit of their interaction as well as their relative precision within pattern instantiations. Instantiations of our design pattern can be applied for local model checking and as preprocessors for algorithms whose worst-case running time is exponential. This design pattern and its aspects have already been implemented in [H. Wang. Framework for Under-Approximating Solutions of Parity Games in Polynomial Time. MEng Thesis, Department of Computing, Imperial College London, 78 pages, June 2007].