Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
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.
Chang, C. and Lee, R., Symbolic logic and mechanical theorem proving, Acad. Press, New York, 1973.
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.
Robinson, J., A machine oriented logic based on the resolution principle, JACM 12, 1965, pp. 23–41.
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.
Venkatesh, G., Resolution in temporal logic, Tech. rept. SSE-CAD-8507, SSE Group, T.I.F.R., Bombay.
Wolper, P., Temporal logic can be more expressive, Information and Control, 56, 1983, pp. 72–79.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Venkatesh, G. (1985). A decision method for temporal logic based on resolution. In: Maheshwari, S.N. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1985. Lecture Notes in Computer Science, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16042-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-16042-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16042-7
Online ISBN: 978-3-540-39722-9
eBook Packages: Springer Book Archive