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

.

##
###
Optimal Satisfiability Checking for Arithmetic μ-Calculi
[article]

2019
*
arXiv
*
pre-print

The coalgebraic μ-calculus provides a generic semantic framework for fixpoint logics with branching types beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic μ-calculus includes an exponential time upper bound on satisfiability checking, which however requires a well-behaved set of tableau rules for the next-step modalities. Such rules are not available in all cases of interest, in particular ones involving either integer weights

arXiv:1901.04893v1
fatcat:kd5upgd6avev3kdofjxpab4y6y