A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Game-Based Local Model Checking for the Coalgebraic mu-Calculus

2019
*
International Conference on Concurrency Theory
*

The coalgebraic µ-calculus is a generic framework for fixpoint logics with varying branching types that subsumes, besides the standard relational µ-calculus, such diverse logics as the graded µ-calculus, the monotone µ-calculus, the probabilistic µ-calculus, and the alternating-time µ-calculus. In the present work, we give a local model checking algorithm for the coalgebraic µ-calculus using a coalgebraic variant of parity games that runs, under mild assumptions on the complexity of the

doi:10.4230/lipics.concur.2019.35
dblp:conf/concur/HausmannS19
fatcat:2b4524tktjchhkr3v2aybi6qq4