DeepAI AI Chat
Log In Sign Up

Priority Promotion with Parysian Flair

by   Massimo Benerecetti, et al.

We develop an algorithm that combines the advantages of priority promotion - the leading approach to solving large parity games in practice - with the quasi-polynomial time guarantees offered by Parys' algorithm. Hybridising these algorithms sounds both natural and difficult, as they both generalise the classic recursive algorithm in different ways that appear to be irreconcilable: while the promotion transcends the call structure, the guarantees change on each level. We show that an interface that respects both is not only effective, but also efficient.


A Recursive Approach to Solving Parity Games in Quasipolynomial Time

Zielonka's classic recursive algorithm for solving parity games is perha...

A Comparison of BDD-Based Parity Game Solvers

Parity games are two player games with omega-winning conditions, played ...

Improving the complexity of Parys' recursive algorithm

Parys has recently proposed a quasi-polynomial version of Zielonka's rec...

A Parity Game Tale of Two Counters

Parity games have important practical applications in formal verificatio...

A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games

In a mean-payoff parity game, one of the two players aims both to achiev...

Recursive Hierarchical Projection for Whole-Body Control with Task Priority Transition

Redundant robots are desired to execute multitasks with different priori...

An Optimal Value Iteration Algorithm for Parity Games

The quest for a polynomial time algorithm for solving parity games gaine...