A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL

Authors:
Martin Lange
Affiliations:
Institut für Informatik, Ludwig-Maximilians-Universität München, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 2
Cited 4

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
An n! lower bound on formula size

ACM Transactions on Computational Logic (TOCL)

On Regular Temporal Logics with Past,

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Graded computation tree logic with binary coding

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Graded computation tree logic

ACM Transactions on Computational Logic (TOCL)
Branching-time logics with path relativisation

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.90

Visualization

Abstract

We provide a conceptually simple and elementary proof of the exponential succinctness gap between the two branching time temporal logics CTL^+ and CTL. It only uses CTL's small model property instead of automata- or game-theory and combinatorics as in previous proofs by Wilke and Adler/Immerman.