Scalar and Vectorial mu-calculus with Atoms
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-e...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2019-10-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/4389/pdf |
Summary: | 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. |
---|---|
ISSN: | 1860-5974 |