Is the interesting part of process logic uninteresting? A translation from PL to PDL
SIAM Journal on Computing
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Alternating automata on infinite trees
Theoretical Computer Science
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
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
Proceedings of the Conference on Logic of Programs
Axiomatising Extended Computation Tree Logic
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Complete Proof Systems for QPTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A commitment-based communicative act library
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Information and Computation
A Commitment-Based Communicative Act Library
Agent Communication II
Commitment Monitoring in a Multiagent System
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Information and Computation
Dealing with time in content language expressions
AC'04 Proceedings of the 2004 international conference on Agent Communication
| Hi-index | 0.00 |
We continue in the same vein as Lichtenstein, Pnueli and Zuck in 驴The Glory of the Past驴, demonstrating the advantages of including past-time operators in using temporal logic in computer science. A normal form for temporal formulas, based on a simple combination of past formulas, is arrived at via syntactic rewrites and is shown to be a useful alternative to automata-based temporal reasoning. The use of the normal form in providing a complete axiomatization for PCTL* (i.e. CTL* with past connectives) is sketched.