A Parity Game Tale of Two Counters



Published in: CoRR



Parity games have important practical applications in formal verification and synthesis, especially for problems related to linear temporal logic and to the modal mu-calculus. The problem is believed to admit a solution in polynomial time, motivating researchers to find candidates for such an algorithm and to defeat these algorithms.

We present a parameterized parity game called the Two Counters game, which provides an exponential lower bound for a wide range of parity game solving algorithms. We are the first to provide an exponential lower bound to priority promotion with the delayed promotion policy, and the first to provide such a lower bound to tangle learning.

BibTeX entry:

 arxiv = {1807.10210},
 author = {Tom van Dijk},
 journal = {CoRR},
 title = {A Parity Game Tale of Two Counters},
 volume = {abs/1807.10210},
 year = {2018}