论文信息 - A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL

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

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.

Martin Lange

[1] Joseph Y. Halpern,et al. Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[2] Jan Johannsen,et al. CTL+ Is Complete for Double Exponential Time , 2003, ICALP.

[3] Thomas Wilke,et al. CTL+ is Exponentially more Succinct than CTL , 1999, FSTTCS.

[4] Neil Immerman,et al. An n! lower bound on formula size , 2003, TOCL.