Abstract
We characterize the expressive power of EX, EF and EX+EF logics. These are the fragments of CTL built using the respective operators. We give a forbidden pattern characterization of the tree languages definable in these logics. The characterizations give optimal algorithms for deciding if a given tree language is expressible in one of the three logics.
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.
Similar content being viewed by others
References
Emerson, E.A., Halpern, J.Y.: ‘Sometimes’ and ‘not never’ revisited: on branching versus linear time temporal logic. Journal of the ACM 33(1), 151–178 (1986)
Esparza, J.: Decidability of model-checking for infinite-state concurrent systems. Acta Informatica 34, 85–107 (1997)
Fischer, M., Ladner, R.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18, 194–211 (1979)
Franceschet, M., Afanasiev, L., de Rijke, M., Marx, M.: CTL model checking for processing simple XPath queries. In: Temporal Presentation and Reasoning
Koch, C., Gottlob, G.: Monadic queries over tree-structured data. In: Logic in Computer Science, pp. 189–202 (2002)
Hafer, T., Thomas, W.: Computation tree logic CTL and path quantifiers in the monadic theory of the binary tree. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 260–279. Springer, Heidelberg (1987)
Heuter, U.: First-order properties of trees, star-free expressions, and aperiodicity. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 136–148. Springer, Heidelberg (1988)
Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)
Niwiński, D.: Fixed points vs. infinte generation. In: Logic in Computer Science, pp. 402–409 (1988)
Otto, M.: Eliminating recursion in the μ-calculus. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 531–540. Springer, Heidelberg (1999)
Potthoff, A.: First-order logic on finite trees. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 125–139. Springer, Heidelberg (1995)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control 8, 190–194 (1965)
Seidl, H.: Deciding equivalence of finite tree automata. SIAM Journal of Computing 19, 424–437 (1990)
Straubing, H.: Finite Automata, Formal Languages, and Circuit Complexity. Birkhäuser, Boston (1994)
Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2(1), 57–81 (1968)
Walukiewicz, I.: Model checking CTL properties of pushdown systems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 127–138. Springer, Heidelberg (2000)
Walukiewicz, I.: Deciding low levels of tree-automata hierarchy. In: Workshop on Logic, Language, Information and Computation. Electronic Notes in Theoretical Computer Science, vol. 67 (2002)
Wilke, T.: Classifying discrete temporal properties. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 32–46. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bojańczyk, M., Walukiewicz, I. (2004). Characterizing EF and EX Tree Logics. In: Gardner, P., Yoshida, N. (eds) CONCUR 2004 - Concurrency Theory. CONCUR 2004. Lecture Notes in Computer Science, vol 3170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28644-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-28644-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22940-7
Online ISBN: 978-3-540-28644-8
eBook Packages: Springer Book Archive