Bartek Klin ; Mateusz Łełyk - Scalar and Vectorial mu-calculus with Atoms

lmcs:4389 - Logical Methods in Computer Science, October 29, 2019, Volume 15, Issue 4 -
Scalar and Vectorial mu-calculus with Atoms

Authors: Bartek Klin ; Mateusz Łełyk

    We study an extension of modal $\mu$-calculus to sets with atoms and we 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 expressive limitations of atom-enriched $\mu$-calculi, and explain how their expressive power depends on the structure of atoms used, and on the choice between basic or vectorial syntax.

    Volume: Volume 15, Issue 4
    Published on: October 29, 2019
    Accepted on: July 30, 2019
    Submitted on: March 20, 2018
    Keywords: Computer Science - Logic in Computer Science,F.4.1,D.2.4

    Linked publications - datasets - softwares

    Source : ScholeXplorer IsCitedBy ARXIV 2004.12141
    Source : ScholeXplorer IsCitedBy DOI 10.4230/lipics.stacs.2021.28
    Source : ScholeXplorer IsCitedBy DOI 10.48550/arxiv.2004.12141
    • 10.48550/arxiv.2004.12141
    • 10.4230/lipics.stacs.2021.28
    • 2004.12141
    Church Synthesis on Register Automata over Linearly Ordered Data Domains
    Exibard, Leo ; Filiot, Emmanuel ; Khalimov, Ayrat ;

    2 Documents citing this article

    Consultation statistics

    This page has been seen 675 times.
    This article's PDF has been downloaded 182 times.