Satisfiability of CTL* with Constraints

@inproceedings{Carapelle2013SatisfiabilityOC,
  title={Satisfiability of CTL* with Constraints},
  author={Claudia Carapelle and Alexander Kartzow and Markus Lohrey},
  booktitle={CONCUR},
  year={2013}
}
We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over ℤ is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF. 

Figures and Topics from this paper

Temporal Logics with Local Constraints ∗
Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL∗ and ECTL∗, with constraints over external structures like the integers with the order orExpand
Satisfiability of ECTL⁎ with constraints
TLDR
It is shown that satisfiability and finite satisfiability for ECTL * with equality-, order-, and modulo-constraints over Z are decidable, and this greatly improves the previously known decidability results for certain fragments of CTL *, e.g., the existential and positive fragments and EF. Expand
Witness Runs for Counter Machines
TLDR
This paper presents recent results about the verification of counter machines by using decision procedures for Presburger arithmetic, and discusses issues related to flat counter machines, path schema enumeration, and the use of SMT solvers. Expand
Model Checking Constraint LTL over Trees
TLDR
A PSPACE algorithm for emptiness of T-constraint automata is provided and this result implies PSPACE-completeness of the satisfiability and the model checking problem for constraint LTL with constraints over T. Expand
Decidability of ALC P ( D ) for concrete domains with the EHD-property
Reasoning for Description logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. For particular, restricted concrete domains decidablity can be regained. We introduce aExpand
Concrete domains in logics
In this short survey, we present logical formalisms in which reasoning about concrete domains is embedded in formulae at the atomic level. These include temporal logics with concrete domains,Expand
Description Logics Reasoning w.r.t. General TBoxes Is Decidable for Concrete Domains with the EHD-Property
TLDR
This work introduces a novel way to integrate concrete domains D into the well-known description logic ALC, and identifies sufficient conditions on D that guarantee decidability of the satisfiability problem, even in the presence of general TBoxes. Expand
On a Fragment of AMSO and Tiling Systems
TLDR
It is proved that satisfiability over infinite words is decidable for a fragment of asymptotic monadic second-order logic, where phi does not use quantifiers over number variables, and variables r and s can be only used simultaneously. Expand
The MSO+U theory of (N, <) is undecidable
TLDR
It is proved that the MSO+U theory of (N,<) is undecidable on infinite words, which settles an open problem about the logic, and improves a previous undecidability result, which used infinite trees and additional axioms from set theory. Expand
Temporal logics on strings with prefix relation
TLDR
It is shown that linear-time temporal logic over concrete domains made of finite strings and the prefix relation admits a PSpace-complete satisfiability problem and an extended version of the logic on strings that is able to compare lengths of longest common prefixes is proposed, for which the Satisfiability problem is shown in PSpace. Expand
...
1
2
...

References

SHOWING 1-10 OF 40 REFERENCES
Deciding Properties of Integral Relational Automata
TLDR
The general model checking problem for CTL* formulae over RA is shown undecidable, but the decidability result is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formULae. Expand
Weak MSO+U over infinite trees *
We prove that, over infinite trees, satisfiability is decidable for Weak Monadic Second-Order Logic extended by the unbounding quantifier U. We develop an automaton model, prove that it is eectivelyExpand
Weak MSO+U over infinite trees
We prove that, over infinite trees, satisfiability is decidable for Weak Monadic Second-Order Logic extended by the unbounding quantifier U. We develop an automaton model, prove that it isExpand
Verification of qualitative Z constraints
TLDR
An LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z, which includes periodicity constraints and comparison constraints of the form x=y and x is introduced. Expand
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
TLDR
This paper substantially extend the decidability border, by considering a meaningful fragment of CTL* extended with such constraints (which subsumes both the universal and existential fragments, as well as the EF-like fragment) and show that satisfiability and model-checking over relational automata that are abstraction of counter machines are decidable. Expand
Computation tree logic and regular omega-languages
  • W. Thomas
  • Mathematics, Computer Science
  • REX Workshop
  • 1988
TLDR
A characterization of CTL* by a "non-counting property" for sets of trees shows that it is decidable whether an ECTL*- formula can be written as a CTL-formula. Expand
An Automata-based Approach for CTL* With Constraints
  • R. Gascon
  • Computer Science, Mathematics
  • INFINITY
  • 2009
TLDR
An automata-theoretic approach to solve verification problems for extensions of the linear-time logic LTL with constraints by allowing constraints between variables at the atomic level is defined. Expand
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic
TLDR
It is shown that every formula of MSOL which does not distinguish between bisimilar models is equivalent to a formula of the propositional Μ-calculus, which implies that every logic over transition systems invariant under bisimulation and translatable into MSOL can be also translated into the Μ -calculus. Expand
A finite model theorem for the propositional μ-calculus
  • D. Kozen
  • Mathematics, Computer Science
  • Stud Logica
  • 1988
TLDR
A finite model theorem and infinitary completeness result for the propositional μ-calculus is proved and a link between finite model theorems for propositional program logics and the theory of well-quasi-orders is established. Expand
An automata-theoretic approach to constraint LTL
TLDR
A new automata-theoretic technique is used to show PSPACE decidability of the logic of linear-time temporal logic with constraints interpreted over a concrete domain, and it is shown that the logic becomes undecidable when one considers constraint systems that allow a counting mechanism. Expand
...
1
2
3
4
...