The Descriptive Complexity of Modal μ Model-checking Games

Karoliina Lehtinen
(University of Kiel)

This paper revisits the well-established relationship between the modal mu calculus and parity games to show that it is even more robust than previously known. It addresses the question of whether the descriptive complexity of modal mu model-checking games, previously known to depend on the syntactic complexity of a formula, depends in fact on its semantic complexity. It shows that up to formulas of semantic co-Büchi complexity, the descriptive complexity of their model-checking games coincides exactly with their semantic complexity. Beyond co-Büchi, the descriptive complexity of the model-checking parity games of a formula is shown to be an upper bound on its semantic complexity; whether it is also a lower bound remains an open question.

In Patricia Bouyer, Andrea Orlandini and Pierluigi San Pietro: Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2017), Roma, Italy, 20-22 September 2017, Electronic Proceedings in Theoretical Computer Science 256, pp. 76–90.
Published: 6th September 2017.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: