CTL+ Is Complete for Double Exponential Time

@inproceedings{Johannsen2003CTLIC,
  title={CTL+ Is Complete for Double Exponential Time},
  author={Jan Johannsen and Martin Lange},
  booktitle={ICALP},
  year={2003}
}
We show that the satisfiability problem for CTL, the branching time logic that allows boolean combinations of path formulas inside a path quantifier but no nesting of them, is 2-EXPTIME-hard. The construction is inspired by Vardi and Stockmeyer’s 2-EXPTIME-hardness proof of CTL∗’s satisfiability problem. As a consequence, there is no subexponential reduction from CTL to CTL which preserves satisfiability. 
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
18 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

Similar Papers

Loading similar papers…