Satisfiability of CTL* with constraints
classification
💻 cs.LO
keywords
fragmentssatisfiabilitycertainconstraintsdecidabilitydecidableequality-existential
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.