On the Model Checking of the Graded μ-calculus on Trees

@inproceedings{Brcenas2015OnTM,
  title={On the Model Checking of the Graded $\mu$-calculus on Trees},
  author={E. B{\'a}rcenas and E. Ben{\'i}tez-Guerrero and J. Lavalle-Mart{\'i}nez},
  booktitle={MICAI},
  year={2015}
}
The \(\mu \)-calculus is an expressive propositional modal logic augmented with least and greatest fixed-points, and encompasses many temporal, program, dynamic and description logics. The model checking problem for the \(\mu \)-calculus is known to be in NP \(\cap \) Co-NP. In this paper, we study the model checking problem for the \(\mu \)-calculus extended with graded modalities. These constructors allow to express numerical constraints on the occurrence of accessible nodes (worlds… Expand
Model-checking graded computation-tree logic with finite path semantics
TLDR
It is proved that the model checking problem of GCTL f ⁎, a variant of Computation Tree Logic CTL, is PSPACE-complete and the path quantifiers of the form E ≥ g ψ express that there are at least g many distinct finite paths that satisfy ψ. Expand
CTL* with graded path modalities
TLDR
The significance of this work is that G is much more expressive than as it adds to it a form of quantitative reasoning, and this is done at no extra cost in computational complexity. Expand
Graded CTL* over Finite Paths
TLDR
GCTLf is introduced, a variant of Computation Tree Logic CTL∗, in which path quantifiers are interpreted over finite paths and can count the number of such paths. Expand
On Regular Paths with Counting and Data Tests
TLDR
An EXPTIME extension of regular paths with data tests and counting operators is identified in terms of a closed under negation Presburger tree logic, which applies for standard query reasoning. Expand
Query reasoning on data trees with counting
TLDR
An EXPTIME extension of regular paths with data tests and counting operators is identified in terms of a closed under negation Presburger tree logic, which applies for standard query reasoning. Expand
On CTL* with Graded Path Modalities
TLDR
The resulting logic is much more expressive than Textsc {CTL}^{*} as it adds to it a form of quantitative reasoning, and this is done at no extra cost in computational complexity. Expand
Consistency checking of attention aware systems
TLDR
This work study a formal notion of consistency in attention aware systems for the educational setting, and proposes an expressive modal logic as specification language, and a consistency checking algorithm defined in terms of the satisfiability problem of the logic. Expand

References

SHOWING 1-10 OF 23 REFERENCES
Model Checking for Graded CTL
TLDR
This paper study the Computational Tree Logic CTL, a branching time extension of classical modal logic, augmented with graded modalities and investigates the complexity issues and proves that the model-checking problem is solvable in polynomial time. Expand
The Complexity of Enriched Mu-Calculi
TLDR
This paper identifies a family of decidable logics that are maximal (and incomparable) in expressive power in the fully enriched μ-calculus by introducing two new automata models, showing that their emptiness problems are ExpTime-complete, and reducing satisfiability in the relevant logics to these problems. Expand
Expressive Reasoning on Tree Structures: Recursion, Inverse Programs, Presburger Constraints and Nominals
TLDR
This work studies the fully-enriched μ-calculus for trees extended with Presburger constraints and shows that the logic is decidable in EXPTIME, achieved by the introduction of a satisfiability algorithm based on a Fischer-Ladner model construction that is able to handle binary encodings of PresBurger constraints. Expand
Graded Computation Tree Logic
TLDR
It is proved that, although GCTL is more expressive than CTL, the satisfiability problem for GCTP remains solvable in ExpTime, and it is shown that G CTL is exponentially more succinct than graded mu-calculus. Expand
On model checking for the µ-calculus and its fragments
In this paper, we consider the model checking problem for the μ-calculus and show that it is succinctly equivalent to the non-emptiness problem of finite-state automata on infinite binary trees withExpand
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
TLDR
A model-checking algorithm for a logic that permits propositions to be defined using greatest and least fixed points of mutually recursive systems of equations is developed, which improves on the best known algorithm for similar fixed-point logics. Expand
Symbolic Model Checking: 10^20 States and Beyond
TLDR
It is shown how the novel mu-calculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satisfiability of linear-time temporal logic formulas, strong and weak observational equivalence of finite transition systems, and language containment of finite omega -automata. Expand
Efficiently Deciding μ-Calculus with Converse over Finite Trees
We present a sound and complete satisfiability-testing algorithm and its effective implementation for an alternation-free modal μ-calculus with converse, where formulas are cycle-free and areExpand
The Complexity of the Graded µ-Calculus
TLDR
In modal logics, graded modalities generalize standard existential and universal modalities in that they express, e.g., that there exist at least n accessible worlds satisfying a certain formula. Expand
Complexity of modal logics with Presburger constraints
TLDR
It is shown that EML satisfiability is only pspace -complete by designing a Ladner-like algorithm, which extends a well-known and non-trivial pspace upper bound for graded modal logic. Expand
...
1
2
3
...