Scalar and Vectorial mu-calculus with Atoms

03/18/2018
by   Bartek Klin, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2022

A Survey on Satisfiability Checking for the μ-Calculus through Tree Automata

Algorithms for model checking and satisfiability of the modal μ-calculus...
research
07/31/2022

Countdown μ-calculus

We introduce the countdown μ-calculus, an extension of the modal μ-calcu...
research
11/29/2020

A Probabilistic Higher-order Fixpoint Logic

We introduce PHFL, a probabilistic extension of higher-order fixpoint lo...
research
05/12/2020

Featured Games

Feature-based SPL analysis and family-based model checking have seen rap...
research
09/23/2020

Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants

We introduce a new game-theoretic semantics (GTS) for the modal mu-calcu...
research
04/27/2023

Pushing the Boundaries of Tractable Multiperspective Reasoning: A Deduction Calculus for Standpoint EL+

Standpoint EL is a multi-modal extension of the popular description logi...
research
11/01/2010

Reasoning about Cardinal Directions between Extended Objects: The Hardness Result

The cardinal direction calculus (CDC) proposed by Goyal and Egenhofer is...

Please sign up or login with your details

Forgot password? Click here to reset