A decision algorithm for full propositional temporal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 697 LNCS, Issue , 1993, Pages 97-109

  Kesten, Y ^a   Manna, Z ^b   McGuire, H ^b   Pnueli, A ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Automatic verification; Incremental tableau; Model checking; Past and future operators; Satisfiability checking; Temporal logic; Validity checking

Indexed keywords

ATOMS; COMPUTER AIDED ANALYSIS; COMPUTER CIRCUITS; MODEL CHECKING;

AUTOMATIC VERIFICATION; EXPONENTIAL COMPLEXITY; FINITE STATE PROGRAM; INCREMENTAL TABLEAU; LINEAR TIME TEMPORAL LOGIC; PROOF OF CORRECTNESS; SATISFIABILITY CHECKING; VALIDITY CHECKING;

TEMPORAL LOGIC;

EID: 84957836728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56922-7_9     Document Type: Conference Paper

References (12)

1. M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta lnformatica, 20:207-226, 1983.
2. M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. J. Comp. Sys. Sci., 18:194-211, 1979.
3. G. D. Gough and H. Barfinger. A semantic driven temporal verification. In Proceedings of ESOP’88, 1988.
4. G. D. Gough. Decision procedures for temporal logic, Master’s thesis, University of Manchester, England, 1984.
5. J.A.W. Kamp. Tense Logic and the Theory of Order. PhD thesis, UCLA, 1968.
6. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th ACM Syrup. Princ. of Prog. Lang., pages 97-107, 1985.
7. O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Proe. Conf. Logics of Programs, volume 193 of Lect. Notes in Comp. Sci., pages 196-218. Springer-Verlag, 1985.
8. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
9. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Sys., 6:68-93, 1984.
10. A. Pnueli and R. Sherman. Semantic tableau for temporal logic. Technical Report CS81-21, The Weizmann Institute, 1981.
11. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. J. ACM, 32:733-749, 1985.
12. R. Sherman and A. Pnueli. Model checking for linear temporal logic: An efficient implementation. Technical report, Information Science Institute, USC, 1989.