CTL+ is complete for double exponential time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 767-775

  Johannsen, Jan ^a   Lange, Martin ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOOLEAN COMBINATIONS; BRANCHING TIME; DOUBLE EXPONENTIAL; PATH QUANTIFIERS; SATISFIABILITY; SATISFIABILITY PROBLEMS;

FORMAL LOGIC;

EID: 35248812403     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_60     Document Type: Article

References (10)

1. M. Adler and N. Immerman. An n! lower bound on formula size. In Proc. 16th Symp. on Logic in Computer Science, LICS'01, pages 197-208, Boston, MA, USA, June 2001. IEEE Computer Society.
2. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, January 1981.
3. E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30:1-24, 1985.
4. E. A. Emerson and J. Y. Halpern. "Sometimes" and "not never" revisited: On branching versus linear time temporal logic. Journal of the ACM, 33(1):151-178, January 1986.
5. E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of programs. SIAM Journal on Computing, 29(1):132-158, February 2000.
6. E. A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming, 8(3):275-306, 1987.
7. O. Kupferman and O. Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4):523-539, August 1996.
8. + and FCTL is hard. In Proc. 4th Conf. Foundations of Software Science and Computation Structures, FOSSACS'01, volume 2030 of LNCS, pages 318-331, Geneva, Italy, April 2001. Springer.
9. M. Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc. 17th Symp. on Theory of Computing, STOC'85, pages 240-251, Baltimore, USA, May 1985. ACM.
10. + is exponentially more succinct than CTL. In Proc. 19th Conf. on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'99, volume 1738 of LNCS, pages 110-121. Springer, 1999.