Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms. We investigate the complexity of Zielonka's Recursive algorithm for solving these special games, showing that the algorithm runs in O(d (n + m)) on weak games, and, somewhat surprisingly, that it requires exponential time to solve dull games and (nested) solitaire games. For the latter classes, we provide a family of games G, allowing us to establish a lower bound of 2^(n/3). We show that an optimisation of Zielonka's algorithm permits solving games from all three classes in polynomial time. Moreover, we show that there is a family of (non-special) games M that permits us to establish a lower bound of 2^(n/3), improving on the previous lower bound for the algorithm.
|Titel||Fourth International Symposium on Games, Automata, Logics and Formal Verification (Borca di Cadore, Dolomites, Italy, August 29-31, 2013)|
|Redacteuren||G. Puppis, T. Villa|
|Status||Gepubliceerd - 2013|
|Naam||Electronic Proceedings in Theoretical Computer Science|
|ISSN van geprinte versie||2075-2180|