POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of branching time
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Yet Another Process Logic (Preliminary Version)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Propositional Dynamic Logic of looping and converse
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Decidability and expressiveness of logics of processes
Decidability and expressiveness of logics of processes
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An internal semantics for modal logic
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A branching time logic with past operators
Journal of Computer and System Sciences
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Alternating-time temporal logic
Journal of the ACM (JACM)
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Relating word and tree automata
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The logic of distributed protocols: preliminary report
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
A clausal resolution method for branching-time logic ECTL+
Annals of Mathematics and Artificial Intelligence
Experiments with deterministic ω-automata for formulas of linear temporal logic
Theoretical Computer Science - Implementation and application of automata
A Temporal Logic of Robustness
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
From LTL to symbolically represented deterministic automata
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
The blow-up in translating LTL to deterministic automata
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Electronic Notes in Theoretical Computer Science (ENTCS)
Robust Vacuity for Branching Temporal Logic
ACM Transactions on Computational Logic (TOCL)
Journal of Computer and System Sciences
Experiments with deterministic ω-automata for formulas of linear temporal logic
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Nondeterminism in the presence of a diverse or unknown future
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
In this paper we study the full branching time logic (CTL*) in which a path quantifier, either A (“for all paths-&-rdquo;) or E (-&-ldquo;for some path”), prefixes an assertion composed of arbitrary combinations of the usual linear time operators F (“sometime”), G (“always”), X (“nexttime”), and U (“until”). We show that the problem of determining if a CTL* formula is satisfiable in structure generated by a binary relation is decidable in triple exponential time. The decision procedure exploits the special structure of the finite state &ohgr;-automata for linear temporal formulae which allows them to be determinized with only a single exponential blowup in size. We also compare the expressive power of tree automata with CTL* augmented by quantified auxillary propositions.