The Complexity of Propositional Linear Temporal Logics

Journal of the ACM (JACM)

Volumn 32, Issue 3, 1985, Pages 733-749

  Sistla, A P ^a   Clarke, E M ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY; NP-COMPLETENESS; PROPOSITIONAL LINEAR TEMPORAL LOGICS; PSPACE-COMPLETENESS;

COMPUTER METATHEORY;

EID: 0022092438     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/3828.3837     Document Type: Article

References (10)

1. CLARKE, E. M., AND EMERSON, A. Design and synthesis of programming skeletons using branching time temporal logic. IBM Conference on Logics of Programs. Lecture Notes in Computer Science, vol. 131, Springer-Verlag, New York, 198 I.
2. HALPERN, J. Y., AND REIF, J. H. The propositional dynamic logic of deterministic, well-structured programs. In Proceedings of the 22nd Symposium on Foundations of Computer Science (Nashville, Tenn.) IEEE, New York, 1981, pp. 322-334. Also in Theoret. Comput. Sci., 27(1983), 127-165.
3. LADNER, R. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6 (1977), 467-480.
4. ONO, H. AND NAKAMURA, A. On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica 39 (1980), 325-333.
5. MANNA, Z., AND WOLPER, P. Synthesizing concurrent programs from temporal logic specilications. IBM Conference on Logics of Programs. Lecture Notes in Computer Science, vol. 131, Springer-Verlag, New York, 1981.
6. PNUELI, A. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (Providence, RI.). IEEE, New York, 1971, pp. 46-57.
7. ROBERTSON, E. L. Structure of complexity in weak monadic second order theories of the natural numbers. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (Providence, RI.). IEEE, New York, 1977, pp. 161-171.
8. SAVITCH, W. J. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 2 (1970), 177-192.
9. SISTLA, A. P., AND CLARKE, E. M. The complexity of propositional linear temporal logics. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (San Francisco, Calif. May 5-7). ACM, New York, 1982, pp. 159-168.
10. WOLPER, P. Temporal logic can be more expressive. In Proceedings of 22nd Symposium on Foundations ofcomputer Science (Nashville, Tenn.). IEEE, New York, 1981, pp. 340-348. Also in Inf: Control 56 (1983), 72-99.