Searching for "CTL is Exponentially more Succinct than CTL." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

CTL^+ Is Exponentially More Succinct Than CTL
by Thomas Wilke, Aachener Informatik-berichte — 1999
…CTL + Is Exponentially More Succinct Than CTL Thomas Wilke Aachener Informatik-Berichte 99-7 y…
Cited by 25 (0 self) – Add To MetaCart

The succinctness of first-order logic on linear orders
by Martin Grohe, Nicole Schweikardt — 2005 — Logical Methods in Computer Science
… arguments to prove that CTL + is exponentially more succinct than CTL. Adler and Immerman [1] were able…
Cited by 7 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB