Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Branching Time Temporal Logic and Amorphous Tree Automata
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
First-Order Logic with Two Variables and Unary Temporal
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
ATL* Satisfiability Is 2EXPTIME-Complete
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Verifying agents with memory is harder than it seemed
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
An automata-theoretic approach to infinite-state systems
Time for verification
Graded computation tree logic with binary coding
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
Improved model checking of hierarchical systems
Information and Computation
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
Journal of Computer and System Sciences
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
ACM Transactions on Computational Logic (TOCL)
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
Tightening the exchange rates between automata
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Branching-time logics with path relativisation
Journal of Computer and System Sciences
| Hi-index | 0.00 |
It is proved that CTL+ is exponentially more succinct than CTL. More precisely, it is shown that every CTL formula (and every modal µ-calculus formula) equivalent to the CTL+ formula E(Fp0 Λ... Λ Fpn-1) is of length at least (n/⌊n/2⌋), which is Ω(2n/√n). This matches almost the upper bound provided by Emerson and Halpern, which says that for every CTL+ formula of length n there exists an equivalent CTL formula of length at most 2n log n. It follows that the exponential blow-up as incurred in known conversions of nondeterministic Büchi word automata into alternation-free µ-calculus formulas is unavoidable. This answers a question posed by Kupferman and Vardi. The proof of the above lower bound exploits the fact that for every CTL (µ-calculus) formula there exists an equivalent alternating tree automaton of linear size. The core of this proof is an involved cut-and-paste argument for alternating tree automata.