Decomposition theorems and model-checking for the modal μ -calculus
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)
Full work available at URL: https://arxiv.org/abs/1405.2234
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (8)
- Universal guards, relativization of quantifiers, and failure models in model checking modulo theories
- Enriched MU-Calculi Module Checking
- A note on model checking the modal \(\nu\)-calculus
- Title not available (Why is that?)
- The mu-calculus and Model Checking
- Parameterized Algorithms for Parity Games
- Structural Refinement for the Modal nu-Calculus
- $\aleph_1$ and the modal $\mu$-calculus
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)