Parity games and automata for game logic

Helle Hvid Hansen, Clemens Kupke, Johannes Marti, Yde Venema

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

4 Citations (Scopus)
104 Downloads (Pure)


Parikh's game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexity of nested fixpoints in modal fixpoint logics, such as the modal μ-calculus. In this paper, we (1) discuss the semantics a of game logic over neighbourhood structures in terms of parity games, and (2) use these games to obtain an automata-theoretic characterisation of the fragment of the monotone μ-calculus that corresponds to game logic. Our proof makes extensive use of structures that we call syntax graphs that combine the ease-of-use of syntax trees of formulas with the flexibility and succinctness of automata. They are essentially a graph-based view of the alternating tree automata that were introduced by Wilke in the study of modal μ-calculus.
Original languageEnglish
Title of host publicationDynamic Logic. New Trends and Applications
Subtitle of host publicationFirst International Workshop, DALI 2017, Brasilia, Brazil, September 23-24, 2017, Proceedings
EditorsAlexandre Madeira, Mário Benevides
Place of PublicationCham
Number of pages18
Publication statusE-pub ahead of print - 3 Jan 2018

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


  • logic
  • automata theory
  • game theory
  • combinatorial problems
  • graph theory


Dive into the research topics of 'Parity games and automata for game logic'. Together they form a unique fingerprint.

Cite this