A decision method for temporal logic based on resolution
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.
- (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).Chang, C. and Lee, R., Symbolic logic and mechanical theorem proving, Acad. Press, New York, 1973.Google Scholar
- (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
- (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).Venkatesh, G., Resolution in temporal logic, Tech. rept. SSE-CAD-8507, SSE Group, T.I.F.R., Bombay.Google Scholar