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

From MaRDI portal
Publication:4635600

DOI10.1145/2603088.2603144zbMATH Open1394.68222arXiv1405.2234OpenAlexW3105868061MaRDI QIDQ4635600FDOQ4635600

Stephan Kreutzer, Mikołaj Bojańczyk, Christoph Dittmann

Publication date: 23 April 2018

Published in: 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) (Search for Journal in Brave)

Abstract: We prove a general decomposition theorem for the modal mu-calculus Lmu 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 M1 and M2 plus edges from M1 to M2, 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 Lmu is fixed-parameter tractable (fpt) on classes of structures of bounded Kelly-width or bounded DAG-width. As far as we are aware, these are the first fpt results for Lmu which do not follow from embedding into monadic second-order logic.


Full work available at URL: https://arxiv.org/abs/1405.2234






Cited In (8)






This page was built for publication: Decomposition theorems and model-checking for the modal μ -calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635600)