Satisfiability of CTL* with Constraints

@inproceedings{Carapelle2013SatisfiabilityOC,
  title={Satisfiability of CTL* with Constraints},
  author={Claudia Carapelle and Alexander Kartzow and M. 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

Satisfiability of ECTL⁎ with constraints
Witness Runs for Counter Machines
Model Checking Constraint LTL over Trees
Decidability of ALC P ( D ) for concrete domains with the EHD-property
On a Fragment of AMSO and Tiling Systems
The MSO+U theory of (N, <) is undecidable
Temporal logics on strings with prefix relation
Satisfiability of ECTL∗ with Local Tree Constraints
...
1
2
...

References

SHOWING 1-10 OF 40 REFERENCES
Deciding Properties of Integral Relational Automata
Weak MSO+U over infinite trees *
Weak MSO+U over infinite trees
Verification of qualitative Z constraints
Computation tree logic and regular omega-languages
  • W. Thomas
  • Mathematics, Computer Science
  • REX Workshop
  • 1988
An Automata-based Approach for CTL* With Constraints
  • R. Gascon
  • Computer Science, Mathematics
  • INFINITY
  • 2009
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic
A finite model theorem for the propositional μ-calculus
  • D. Kozen
  • Mathematics, Computer Science
  • Stud Logica
  • 1988
An automata-theoretic approach to constraint LTL
...
1
2
3
4
...