A decision algorithm for full propositional temporal logic

Y. Kesten, Z. Manna, H. McGuire, A. Pnueli

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

61 Scopus citations

Abstract

The paper presents an efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators. This algorithm can be used to check validity of such formulas over all models as well as over computations of a finite-state program (model checking). Unlike previous theoretical presentations of a decision method for checking satisfiability or validity, whose first step is to construct the full set of all possible atoms of a tableau (satisfaction graph) and immediately pay the worst case exponential complexity price, tile algorithm presented here builds the tableau incrementally. This means that the algorithm constructs only those atoms that are reachable from a possible initial atom, satisfying the formula to be checked. While incremental tableau construction for the future fragment of linear time temporal logic can be done in a single pass, the presence of past operators requires multiple passes that successively construct augmented versions of existing atoms, while still maintaining consistency and teachability. The proof of correctness of the algorithm is based on showing that any model of the considered formula is embedded as a path in the tableau at all the construction stages, and can be delineated when the construction terminates. The paper also describes an implementation of the algorithm with further attention to efficiency. This implementation is available as a support system for the book [8] under the name "temporal prover". It has been used to verify all the propositional temporal formulas and to model-check all the finite-state programs appearing in the book.

Original languageEnglish
Title of host publicationComputer Aided Verification - 5th International Conference, CAV 1993, Proceedings
EditorsCostas Courcoubetis
PublisherSpringer Verlag
Pages97-109
Number of pages13
ISBN (Print)9783540569220
DOIs
StatePublished - 1 Jan 1993
Externally publishedYes
Event5th International Conference on Computer Aided Verification, CAV 1993 - Elounda, Greece
Duration: 28 Jun 19931 Jul 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume697 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Computer Aided Verification, CAV 1993
Country/TerritoryGreece
CityElounda
Period28/06/931/07/93

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A decision algorithm for full propositional temporal logic'. Together they form a unique fingerprint.

Cite this