Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Compositional Approach to Parity Games (2112.14058v1)

Published 28 Dec 2021 in cs.GT

Abstract: 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`es 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Kazuki Watanabe (15 papers)
  2. Clovis Eberhart (16 papers)
  3. Kazuyuki Asada (10 papers)
  4. Ichiro Hasuo (71 papers)
Citations (6)

Summary

We haven't generated a summary for this paper yet.