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

.

##
###
Decomposition theorems and model-checking for the modalμ-calculus

2014
*
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14
*

We prove a general decomposition theorem for the modal μ-calculus L_μ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two substructures M_1 and M_2 plus edges from M_1 to M_2, then the formulas true at a node in M only depend on the formulas true in the respective substructures in a sense made precise below. As a consequence we show that the model-checking problem for L_μ is fixed-parameter

doi:10.1145/2603088.2603144
dblp:conf/csl/BojanczykDK14
fatcat:vfhrvywtezbvjis7i3mglnqzfq