A decision method for temporal logic based on resolution

  • G. Venkatesh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 206)


A decision method for linear temporal logic is presented. The given temporal formula is first converted into a normal form formula containing restricted nesting of temporal operators. The resulting formula is tested for satisfiability by using four crucial operations — Unwinding Resolution, SKIP and deletion of persistent eventual terms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    Cavalli,A.R. and Del Cerro, F.L, A decision method for linear temporal logic, Proc. 7th International Conference on Automated Deduction, LNCS 170, 1984.Google Scholar
  2. (2).
    Chang, C. and Lee, R., Symbolic logic and mechanical theorem proving, Acad. Press, New York, 1973.Google Scholar
  3. (3).
    Manna, Z. and Pneuli, A., The verification of concurrent programs: The temporal framework. In Boyer and Moore eds., The correctness problem in computer science, pp.215–273, Acad. Press, New York, 1981.Google Scholar
  4. (4).
    Robinson, J., A machine oriented logic based on the resolution principle, JACM 12, 1965, pp. 23–41.CrossRefGoogle Scholar
  5. (5).
    Sistla, A.P. and Emerson, E.A., The complexity of propositional linear time logics, Proc. 16th ACM Symposium on the theory of computing, 1982, pp. 159–168.Google Scholar
  6. (6).
    Venkatesh, G., Resolution in temporal logic, Tech. rept. SSE-CAD-8507, SSE Group, T.I.F.R., Bombay.Google Scholar
  7. (7).
    Wolper, P., Temporal logic can be more expressive, Information and Control, 56, 1983, pp. 72–79.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • G. Venkatesh
    • 1
  1. 1.SSE Group, TifrBombayIndia

Personalised recommendations