“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Current trends in concurrency. Overviews and tutorials
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
Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree
ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
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
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Verifying time, memory and communication bounds in systems of reasoning agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
Dealing with time in content language expressions
AC'04 Proceedings of the 2004 international conference on Agent Communication
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*.