2000 character limit reached
Satisfiability of CTL* with constraints (1306.0814v1)
Published 4 Jun 2013 in cs.LO
Abstract: 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.