Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
Alternating automata on infinite trees
Theoretical Computer Science
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Reasoning about infinite computations
Information and Computation
A hierarchy of temporal logics with past
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
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
Specification in CTL + Past for verification in CTL
Information and Computation - Special issue on EXPRESS 1997
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
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
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Comparing Linear and Branching Time Temporal Logics
Temporal Logic in Specification
Proceedings of the Conference on Logic of Programs
The Taming of Converse: Reasoning about Two-way Computations
Proceedings of the Conference on Logic of Programs
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Propositional Dynamic Logic of looping and converse
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
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
Memoryful Branching-Time Logic
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Theories of automata on ω-tapes: A simplified approach
Journal of Computer and System Sciences
The complexity of CTL* + linear past
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Proceedings of the 18th ACM symposium on Access control models and technologies
Hi-index | 0.00 |
It has long been known that past-time operators add no expressive power to linear temporal logics. In this paper, we consider the extension of branching temporal logics with past-time operators. Two possible views regarding the nature of past in a branching-time model induce two different such extensions. In the first view, past is branching and each moment in time may have several possible futures and several possible pasts. In the second view, past is linear and each moment in time may have several possible futures and a unique past. Both views assume that past is finite. We discuss the practice of these extensions as specification languages, characterize their expressive power, and examine the complexity of their model-checking and satisfiability problems.