2026-07-20T05:05:11Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7699 2024-03-06T10:40:46Z ddc:004 open_access

Modal mu-Calculus with Atoms Klin, Bartek Lelyk, Mateusz modal mu-calculus sets with atoms We introduce an extension of modal mu-calculus to sets with atoms and study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable. We also show some limitations to the expressiveness of the calculus and argue that a naive way to remove these limitations results in a logic whose model checking is undecidable. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Bartek Klin and Mateusz Lelyk 2017 Is Part Of LIPIcs, Volume 82, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2017.30 urn:nbn:de:0030-drops-76991 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.30 eng https://creativecommons.org/licenses/by/3.0/legalcode