A classification of &ohgr;-regular languages
Theoretical Computer Science
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Finite automata on directed graphs
Journal of Computer and System Sciences
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Yet Another Process Logic (Preliminary Version)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth 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
Automata theoretic techniques for modal logics of programs: (Extended abstract)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Tree acceptors and some of their applications
Journal of Computer and System Sciences
A formal model for service-oriented interactions
Science of Computer Programming
| Hi-index | 0.00 |
An expressive branching time logic is introduced. Its power allows us to describe the local structure of the underlying graph of the computation. The logic's linear operators correspond to all the relations definable by finite automata and are able to express the computations in the past, in addition to the computations in the future. In particular the logic contains as a fragment the ordinary temporal logic of branching time. It is shown that the logic is decidable. The proof is based on reduction to the emptiness problem for graph automata.