“Sometimes” and “Not Never” Revisited: On Branching Versus Linear Time Temporal Logic

Journal of the ACM (JACM)

Volumn 33, Issue 1, 1986, Pages 151-178

  Emerson, E Allen ^a   Halpern, Joseph Y ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Concurrent programs; parallelism; temporal logic

Indexed keywords

COMPUTER METATHEORY - PROGRAMMING THEORY; COMPUTER PROGRAMMING LANGUAGES;

CONCURRENT PROGRAMS; TEMPORAL LOGIC;

COMPUTER PROGRAMMING;

EID: 0022514018     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/4904.4999     Document Type: Article

References (34)

1. ABRAHAMSON, K. Decidability and expressiveness of logics of processes. P h.D. dissertation, Univ. of Washington, Seattle, 1980.
2. BEN-ARI. M., MANNA, Z., AND PNUELI, A. The temporal logic of branching time. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages (Williamsburg, Va., Jan. 26-28). ACM, New York, 1981, pp. 164-176.
3. CLARKE, E. M., AND EMERSONE,. A. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of the IBM Workshop on Logics of Programs. Lecture Notes in Computer Science, vol. 131. Springer-Verlag, New York, 1981, pp. 52-71.
4. CLARKE, E. M., EMERSONE,. A., AND SISTLA,A. P. Automatic verification oftinite-state concurrent systems using temporal logic specifications: A practical approach. In Proceedings of the 10th Annual ACM Symposium on Principles of Programming Languages (Austin, Tex., Jan. 24-26). ACM, New York, 1983, pp. 117-126.
5. EMERSON, E. A. Alternative semantics for temporal logics. Theor. Comput. Sci. 26 (1983), 121-130.
6. EMERSON, E. A. Automata, tableaux, and temporal logics. In Proceedings of the Brooklyn College Conference on Logics of Programs 1985. Lecture Notes in Computer Science, vol. 193. Springer- Verlag, New York, 1985, pp. 79-87.
7. EMERSON, E. A., AND CLARKE. E. M. Characterizing correctness properties of parallel programs as fixpoints. In Proceedings of the 7th International Colloquium on Automata. Languages, and Programming. Lecture Notes in Computer Science, vol. 85. Springer-Verlag. New York, 1980, pp. 169-181.
8. EMERSON, E. A., AND CLARKE, E. M. Using branching time logic to synthesize synchronization skeletons. Sci. Cornput. Prog. 2 (1982). 241-266.
9. EMERSON, E. A., AND HALPERN, J. Y. Decision procedures and exprqssiveness in the temporal logic of branching time. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (San Francisco, Calif., May 5-7). ACM, New York, 1982, pp. 169-180.
10. EMERSON, E. A., AND HALPERN,J. Y. “Sometimes” and “not never” revisited: On branching vs. linear time. Res. Rep. RJ 4197, IBM Research, San Jose, Calif., 1984 (Also Tech. Rep. 84-01, Comput. Sci. Dept., Univ. of Texas, Austin, Tex. 1984).
11. EMERSON, E. A., AND LEI, C. L. Modalities for model checking: Branching time strikes back. In Proceedings of the 12th Anmral ACM Symposium on Principles of Programming Languages (New Orleans. La., Jan. 14-16). ACM, New York, 1985, pp. 84-96.
12. EMERSON, E. A., AND SISTLA. A. P. Deciding full branching time logic. In: Control 61, 3 (1984), 175-201.
13. FISCHER, M. J., AND LADNER.R. E. Propositional dynamic logic of regular programs. J. Cumput. Syst. Sci. 18 (1979), 194-211.
14. GABBAY, D., PNUELI, A., SHELAH, S., AND STAVI, J. On the temporal analysis of fairness. In Proceedings of the 7th Annual ACM Symposium on Principle of Programming Languages (Las Vegas, Nev. Jan. 28-30). ACM, New York, 1980, pp. 163-173.
15. HAILPERN, B., AND OWICKI, S. Modular verification of concurrent programs using temporal logic. Tech. Rep. Stanford Univ. Stanford, Calif. 1981.
16. HAREL, D. KOZEN, D., AND PARIKH, R. Process logic: Expressiveness, decidability, and completeness. J. Comput. Syst. Sri. 25 (1982), 144-170.
17. HAREL, D. AND SHERMAN, R. Looping vs. repeating in dynamic logic. Inf Control 55 (1982), 175-192.
18. KAMP, H. Tense logic and the theory of linear order. Ph.D. dissertation, UCLA, Los Angeles, 1968.
19. LAMPORT. L. “Sometime” is sometimes “not never”-On the temporal logic of programs. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages (Ias Vegas, Nev., Jan. 28-30). ACM, New York, 1980, pp. 174-185.
20. LEHMANN, D., AND SHELAH, S. Reasoning with time and chance. InJ Control 53 (1982), 165-198.
21. MANNA, Z., AND PNUELI, A. The modal logic of programs. In Proceedings of the 6th International Cofloyuirrm on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 71. Springer-Verlag. New York, 1979, pp. 385-408.
22. MANNA, Z., AND WOLPER, P. Synthesis of communicating processes from temporal logic specilications. ACM Trans. Prog. Lung. Syst. 6, I (Jan. l984), 68-93.
23. OWICKI, S., AND LAMPORT, L. Proving liveness properties of concurrent programs. ACM Trans. Prog. Lang. Syst. 4, 3 (July l982), 455-495.
24. PNUELI, A. The temporal logic of programs. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science. IEEE, New York, 1977, pp. 46-57.
25. PNUELI, A. The temporal semantics of concurrent programs. Theor. Comput. Sci. 13 (1981), 45-60.
26. PRATT, V. R. Process logic. In Proceedings of the 6th Annual ACM Symposium on Principles of Progrumming Langwges (San Antonio, Tex., Jan. 29-31). ACM, New York, 1979, pp. 93-100.
27. PRIOR, A. Time and Modality. Oxford Univ. Press, London, 1957.
28. PRIOR, A. Pust, Present, and Future. Oxford Univ. Press, London, 1967.
29. RESCHER, N., AND URQUHART, A. Temporal logic. Springer-Verlag, Berlin, 1971.
30. SISTLA. A. P., AND CLARKE, E. M. The complexity of propositional linear temporal logic. J. ACM 32,3 (1985), 733-749.
31. VARDI, M., AND STOCKMEYERL,. Improved upper and lower bounds for modal logics of programs. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (Providence, R. I., May 6-8). ACM, New York, 1985, pp. 240-251.
32. VARDI, M., AND WOLPER, P. Yet another process logic. In CMU Workshop on Logics ofprograms. Lecture Notes in Computer Science, vol. 164. Springer-Verlag, New York, 1953, pp. 501-512.
33. WOLPER, P. Specification and synthesis of communicating processes using an extended temporal logic (preliminary version). In Proceedings of the 9th Annual ACM Symposium on Principles of Progrumming Lunguuges (Albuquerque, N. M., Jan. 25-27). ACM, New York, 1982, pp. 20-33.
34. WOLPER, P. Temporal logic can be more expressive. Inf: Control 56, 1 (1983), 72-99.