On Lamport's comparison between linear and branching time temporal logic
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1984)
- Volume: 18, Issue: 4, page 345-353
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 1. E. M. CLARKE and E. A. EMERSON, Design and synthesis of synchronization skeletons using branching time logic, Harvard University TR-12-81. Zbl0546.68014
- 2. E. A. EMERSON, Alternative semantics for temporal logics, University of Texas at Austin, TR-182. Zbl0559.68050
- 3. E. A. EMERSON and J. Y HALPERN, Decision procedure and expressiveness in temporal logic of branching time, 14th Annual ACM Symp. on Theory of Computing, 1982. Zbl0559.68051
- 4. E. A. EMERSON and J. Y. HALPERN, "Sometimes" and "Not Never" revisited: on branching versus linear time, ACM Symp. on Principals of Programming Languages. Zbl0629.68020
- 5. L. LAMPORT, "Sometimes" is sometimes "Not Never", 7th Annual ACM Symp. on Principals of Programming Languages, 1980.
- 6. A. PNUELI, The temporal logic of concurrent Programs, 19th Annual Symp. on Foundations on Computer Science, 1971.
- 7. J. P. QUEILLE and J. SIFAKIS, Specification and verification of concurrent Systems in CESAR, 5th International Symp. on Programming, 1982. Zbl0482.68028MR807187