DeepAI AI Chat
Log In Sign Up

Predicting Winning Regions in Parity Games via Graph Neural Networks (Extended Abstract)

by   Tobias Hecking, et al.

Solving parity games is a major building block for numerous applications in reactive program verification and synthesis. While there exist efficient approaches to solving parity games in practice, none of these have a polynomial worst-case runtime complexity. We present a incomplete approach to determining the winning regions of parity games via graph neural networks. Our evaluation on 900 randomly generated parity games shows that this approach is efficient in practice. It moreover correctly determines the winning regions of  60 games in our data set and only incurs minor errors in the remaining ones.


page 1

page 2

page 3

page 4


Partial Solvers for Generalized Parity Games

Parity games have been broadly studied in recent years for their applica...

Justifications and a Reconstruction of Parity Game Solving Algorithms

Parity games are infinite two-player games played on directed graphs. Pa...

Attracting Tangles to Solve Parity Games

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

On-The-Fly Solving for Symbolic Parity Games

Parity games can be used to represent many different kinds of decision p...

Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games

The McNaughton-Zielonka divide et impera algorithm is the simplest and m...

A Compositional Approach to Parity Games

In this paper, we introduce open parity games, which is a compositional ...

Graph Neural Network Surrogates of Fair Graph Filtering

Graph filters that transform prior node values to posterior scores via e...