Log In Sign Up

A Compositional Approach to Parity Games

by   Kazuki Watanabe, et al.

In this paper, we introduce open parity games, which is a compositional approach to parity games. This is achieved by adding open ends to the usual notion of parity games. We introduce the category of open parity games, which is defined using standard definitions for graph games. We also define a graphical language for open parity games as a prop, which have recently been used in many applications as graphical languages. We introduce a suitable semantic category inspired by the work by Grellois and Melliès on the semantics of higher-order model checking. Computing the set of winning positions in open parity games yields a functor to the semantic category. Finally, by interpreting the graphical language in the semantic category, we show that this computation can be carried out compositionally.


page 1

page 2

page 3

page 4


Towards functorial language-games

In categorical compositional semantics of natural language one studies f...

Simple Fixpoint Iteration To Solve Parity Games

A naive way to solve the model-checking problem of the mu-calculus uses ...

Featured Games

Feature-based SPL analysis and family-based model checking have seen rap...

Games on graphs: a compositional approach

The analysis of games played on graph-like structures is of increasing i...

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

Solving parity games is a major building block for numerous applications...

Fixpoint Games on Continuous Lattices

Many analysis and verifications tasks, such as static program analyses a...

The algebra of predicting agents

The category of open games, which provides a strongly compositional foun...