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
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Finite Models for Deterministic Propositional Dynamic Logic
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Efficient temporal reasoning (extended abstract)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A decidable temporal logic to reason about many processes
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed 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 infinite hierarchy of temporal logics over branching time
Information and Computation
"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
Why so Many Temporal Logics Climb up the Trees?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
CMSB '03 Proceedings of the First International Workshop on Computational Methods in Systems Biology
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Automata theoretic techniques for modal logics of programs: (Extended abstract)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A logic to reason about likelihood
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The logic of distributed protocols: preliminary report
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
State updating of channel communication system CBCTL
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
Experiments in the use of τ-simulations for the components-verification of real-time systems
Proceedings of the 2006 conference on Specification and verification of component-based systems
Relating counterexamples to test cases in CTL model checking specifications
Proceedings of the 3rd international workshop on Advances in model-based testing
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Arity hierarchy for temporal logics
Theoretical Computer Science
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Modular verification of dynamically adaptive systems
Proceedings of the 8th ACM international conference on Aspect-oriented software development
Reasoning about System-Degradation and Fault-Recovery with Deontic Logic
Methods, Models and Tools for Fault Tolerance
Belief updating by communication channel
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
A complete and compact propositional deontic logic
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
An integrated approach to P systems formal verification
CMC'10 Proceedings of the 11th international conference on Membrane computing
Synthesis from temporal specifications using preferred answer set programming
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Incremental verification of component-based timed systems
International Journal of Computer Applications in Technology
Formal modeling of a slicing algorithm for java event spaces in PVS
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Interrupt Timed Automata: verification and expressiveness
Formal Methods in System Design
Declarative enhancement framework for business processes
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
SensorChecker: reachability verification in mission-oriented sensor networks
Proceedings of the 2nd ACM annual international workshop on Mission-oriented wireless sensor networking
A mechanized semantic framework for real-time systems
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
In this paper we consider the Computation Tree Logic (CTL) proposed in [CE] which extends the Unified Branching Time Logic (UB) of [BMP] by adding an until operator. We establish that CTL has the small property by showing that any satisfiable CTL formulae is satisfiable in a small finite model obtained from a small -&-ldquo;pseudo-model-&-rdquo; resulting from the Fischer Ladner quotient construction. We then give an exponential time algorithm for deciding satisfiability in CTL, and extend the axiomatization of UB given in [BMP] to a complete axiomatization for CTL. Lastly, we study the relative expressive power of a family of temporal logics obtained by extending or restricting the syntax of UB and CTL.