Abstract
An automata-theoretic framework for branching-time temporal logics is presented. We introduce a new type of finite automata on infinite trees, the amorphous automata, and use them as a formalism to represent efficiently CTL formulas. In addition, we introduce simultaneous trees, and associate with every model for CTL, a simultaneous tree that enables a tree automaton to visit different nodes on the same path of the tree simultaneously. With every formula ψ, we associate an amorphous automaton U ψ, that accepts exactly those simultaneous trees (of any branching degree) that originate from models that satisfy ψ. This enables to use the automaton both for model checking which is reduced to the membership problem, and for satisfiability decision, which is reduced to testing the nonemptiness of an extension of U ψ that does not assume simultaneous input trees.
The amorphous automata for CTL use the Büchi acceptance condition. The size of U ψ is linear in ¦ψ¦ and the extension required for satisfiability is exponential. Based on that, we get a polynomial model checking procedure and an exponential decision procedure for CTL, both match the known lower bounds. This is the first time that a model checking algorithm for a branching-time temporal logic is placed in the automata-theoretic framework.
Preview
Unable to display preview. Download preview PDF.
References
Clarke, E.M. and Emerson, E.A., Design and synthesis of synchronization skeletons using branching time temporal logic. Proc. Workshop on Logic of Programs, LNCS 131 (1981) 52–71
Emerson, E.A., Temporal and modal logic. Handbook of theoretical computer science. (1990) 997–1072 North-Holland.
Emerson, E.A. and Sistla, A.P., Deciding full Branching Time Logics. Inform. and Control 61(3) (1984) 175–201.
Harel, D., Effective Transformations on Infinite Trees, with Applications to High Undecidability, Dominoes and Fairness. J. Assoc. Comput. Mach. 33 (1986) 224–248.
Pnueli A., The temporal logic of programs. Proc. 18th Symp. on Foundation of Computer Science. (1977) 46–57.
Rabin, M.O., Decidability of second order theories and automata on infinite trees. Trans. AMS, 141 (1969) 1–35.
Thomas W., Automata on Infinite Objects. Handbook of theoretical computer science.(1990) 165–191, North-Holland.
Vardi M.Y., Automata theory for database theoreticians. Proc. 8th ACM Symp. on Principles of Data Systems. (1989) 83–92.
Vardi, M.Y., Verification of concurrent programs: the automatatheoretic framework. Annals of Pure and Applied Logic 51 (1991) 79–98.
Vardi, M.Y. and Wolper, P., Automata theoretic techniques for modal logics of programs. Journal of computer and system science 32. (1986) 183–221
Vardi M.Y. and Wolper P., An Automata theoretic approach to automatic program verification. Proc. Symp. on Logic in Computer Science, (1986) 322–331
Wolper, P., On the relations of programs and computations to models of temporal logic, Temporal Logic in Specification, LNCS 398, (1989) 75–123
Wolper P., Vardi M.Y., and Sistla P., Reasoning about infinite computation paths, Proc. 24th Symp. on Foundations of Computer Science, (1983) 185–194.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernholtz, O., Grumberg, O. (1993). Branching time temporal logic and amorphous tree automata. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_19
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57208-4
Online ISBN: 978-3-540-47968-0
eBook Packages: Springer Book Archive