Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Journal of the ACM (JACM)
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing
An n! Lower Bound on Formula Size
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
BTL2 and the expressive power of ECTL+
Information and Computation
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Branching-time logics with path relativisation
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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.