CTL+ is exponentially more succinct than CTL

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

Volumn 1738, Issue , 1999, Pages 110-121

  Wilke, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY; SOFTWARE ENGINEERING;

ALTERNATING TREE AUTOMATON; BLOW-UP; CUT-AND-PASTE; EMERSON; HEIDELBERG; LOWER BOUNDS; UPPER BOUND; WORD AUTOMATA;

CALCULATIONS;

EID: 84958743461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46691-6_9     Document Type: Conference Paper

References (12)

1. O. Bernholtz [Kupferman] and O. Grumberg. Branching temporal logic and amorphous tree automata. In E. Best, ed., CONCUR’93, vol. 715 of LNCS, 262-277.
2. O. Bernholtz [Kupferman], M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D. L. Dill, ed., CAV '94, vol. 818 of LNCS, 142-155.
3. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach. In PoPL '83, 117-126.
4. E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. In STOC '82, 169-181.
5. E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. J. Comput. System Sci., 30(1):1-24, 1985.
6. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of µ-calculus. In C. Courcoubetis, ed., CAV '93, vol. 697 of LNCS, 385-396.
7. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In LICS '86, 267-278.
8. K. Etessami, M. Y. Vardi, and Th. Wilke. First-order logic with two variables and unary temporal logic. In LICS '97, 228-235.
9. J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968.
10. O. Kupferman and M. Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In LICS '98, 81-92.
11. L. J. Stockmeyer. The Complexity of Decision Problems in Automata Theory and, Logic. PhD thesis, Dept. of Electrical Engineering, MIT, Boston, Mass., 1974.
12. + is exponentially more succinct than CTL. Technical Report 99-7, RWTH Aachen, Fachgruppe Informatik, 1999. Available online via ftp://ftp.informatik.rwth-aachen.de/pub/reports/1999/index.html.