Decision procedures and expressiveness in the temporal logic of branching time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1982, Pages 169-180

  Fmerson, K Allen ^a   Halpern, Joseph Y ^b,c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

AXIOMATIZATION; BRANCHING TIME; COMPLETE AXIOMATIZATIONS; COMPUTATION TREE LOGIC; DECISION PROCEDURE; EXPONENTIAL TIME ALGORITHM; EXPRESSIVE POWER; SATISFIABILITY;

TEMPORAL LOGIC;

EID: 85027646065     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800070.802190     Document Type: Conference Paper

References (14)

1. M. Ben-Ari, personal communication.
2. M. Ben-Ari, J. Y. Halpern, and A. Pnueli, Finite models of deteministie propositional dynamic logic, ICALP 1981, pp. 249-263. A revised version appears as: Deterministic prupositional dynamic logic: finite models, complexity, and completeness, MIT7LCS/TM-190, 1981.
3. M. Ben-Ari, Z. Manna, and A. Pnueli, The temporal logic of branching time, POPE 1981, pp. 164-176.
4. K. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using blanching time temporal logic. Proceedings of the Workshop on Logics of Programs, Ed. D. Kozcn, Springer-Verlag, 1982 (to appear). A revised version appears as Harvard University TR-12-81, 1981.
5. E. A. Emerson and E. M. Clarke, Characterizing correctness properties of parallel programs as fixpoints, ICALP 1980, pp. 169-181.
6. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi, On the temporal analysis of fairness. POPE 1980, pp. 163-173.
7. H. W. Kamp, Tense logic and the theory of linear order, Ph.D. diesis, UCLA, 1968.
8. D. Kozen and R. Parikh. An elementary proof of the completeness of PDL. Theoretical Computer Science, 14:1, pp. 113-118, 1981.
9. L. Lamport, "Sometimes" is sometimes "not never", POPL 1980. pp. 174-183.
10. Z. Manna and A. Pnueli, The modal logic of programs, ICALP 1979, pp. 385-410.
11. A. Pnueli, The temporal logic of programs, FOCS 1977, pp. 46-57.
12. V. R. Pratt, Applications of modal logic to programming, MIT/LCS/TM-116, 1978.
13. V. R. Pratt, Models of program logics, FOCS 1979, pp. 115-122.
14. R. S. Streett. Prepositional dynamic logic of looping and converse, Ph.D. thesis, M.I.T., 1981.