We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.
@article{arxiv.1306.0814,
title = {Satisfiability of CTL* with constraints},
author = {Claudia Carapelle and Alexander Kartzow and Markus Lohrey},
journal= {arXiv preprint arXiv:1306.0814},
year = {2013}
}