“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
Specification in CTL + Past for verification in CTL
Information and Computation - Special issue on EXPRESS 1997
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Hierarchy of Temporal Logics with Past (Extended Abstract)
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Comparing Linear and Branching Time Temporal Logics
Temporal Logic in Specification
Proceedings of the Conference on Logic of Programs
A Deductive Proof System for CTL
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Real-time programming and asynchronous message passing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
Declarative Agent Languages and Technologies VI
A Labeled Natural Deduction System for a Fragment of CTL*
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
TOOLS'11 Proceedings of the 49th international conference on Objects, models, components, patterns
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Complexity Results of STIT Fragments
Studia Logica
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
A sound and complete axiomatization for a computation tree logic with past operators, PCTL*, is given. The logic extends the standard branching time logic CTL* of R-generable models via the use of past time operators and semantics based on a finite linear past leading back from any point in any fullpath. Furthermore, the valid formulas of CTL* are also valid in PCTL*. The past operators allow us to avoid use of any unusual rules of inference such as the ugly automata-motivated AA rule which is part of the existing complete axiomatization for CTL*.