Abstract
In this paper we consider proof techniques for branching-time temporal logics. While a considerable amount of research has been carried out regarding the relationship between finite automata and such logics, practical proof techniques for such logics have received relatively little attention. Recently, however, several applications requiring refined proof methods for branching-time temporal logics have appeared, most notably the specification and verification of multi-agent systems. Thus, here we extend our clausal resolution method for linear-time temporal logics to a branching-time framework, in particular to the powerful CTL* logic. The key elements of the resolution method, namely the normal form, the concept of step resolution and a novel temporal resolution rule, are introduced, justified, and applied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O. Bernholtz and O. Grumberg. Branching-Time Temporal Logic and Amorphous Tree Automata. In Proc. of 4th Conference on Concurrency Theory, Springer-Verlag, (LNCS 715), 1993.
O. Bernholtz, M. Vardi and P. Wolper. An Automata-Theoretic Approach to Branching-Time Model Checking. In Proc. Conf. on Computer-Aided verification (CAV’94), June 1994, Springer-Verlag, (LNCS 818), pp 142–155.
A. Bolotov. Clausal Resolution for Branching-Time Temporal Logic. PhD Thesis. In preparation.
A. Bolotov and M. Fisher A clausal resolution method for CTL branching time temporal Logic. Journal of experimental and theoretical artificial intelligence, Taylor & Francis, 11, 1999, pp 77–93.
E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronisation Skeletons Using Branching Time Temporal Logic. Springer-Verlag, (LNCS 131), 1981.
C. Dixon. Search Strategies for Resolution in Temporal Logics. In Proceedings of the Thirteenth International Conference on Automated Deduction (CADE), Springer-Verlag, August 1996.
E. A. Emerson. Alternative Semantics for Temporal Logics. Theoretical Computer Science, 26, 1983, pp 120–130.
E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pp 996–1072. Elsevier, 1990.
E. A. Emerson. Automated Reasoning about Reactive Systems. In Logics for Concurrency: Structures Versus Automata, Springer-Verlag, (LNCS 1043), 1996.
M. Fisher. A Resolution Method for Temporal Logic. In Proc. Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, 1991. Morgan Kaufman.
M. Fisher. A Normal Form for Temporal Logic and its Application in Theorem-Proving and Execution. Journal of Logic and Computation, 7(4), August 1997.
R. Kaivola. Axiomatizing Extended Computation Tree Logic. In Proceedings of 21st International Colloquium on Trees in Algebra and Programming — CAAP’96, volume 1059 of Lecture Notes in Computer Science, pp 87–101. Springer-Verlag, 1996.
D. E. Muller and P. E. Schupp. Alternating automata on infinite trees. In Theoretical Computer Science, pp 267–276, vol.54, 1987.
D.E. Muller and P.E. Schupp. Simulating Alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton. In Theoretical Computer Science, pp 69–107, vol. 141, 1995.
A. S. Rao. Decision procedures for prepositional linear-time Belief-Desire-Intention logics. In Intelligent Agents II (LNAI 1037). Springer-Verlag: Heidelberg, Germany, 1996.
C. Stirling. Modal and Temporal Logics. In Handbook of Logic in Computer Science. Oxford University Press, 1992.
M. Y. Vardi. An Automata-theoretic Approach to Linear Temporal Logic. In Logics for Concurrency: Structures Versus Automata, Springer-Verlag (LNCS 1043), 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bolotov, A., Dixon, C., Fisher, M. (1999). Clausal Resolution for CTL. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-48340-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66408-6
Online ISBN: 978-3-540-48340-3
eBook Packages: Springer Book Archive