Abstract
The paper explores the relationship between tree languages definable in LTL, CTL, and ACTL, the fragment of CTL where only universal path quantification is allowed. The common fragment of LTL and ACTL is shown to be strictly smaller than the common fragment of LTL and CTL. Furthermore, an algorithm is presented for deciding if an LTL formula can be expressed in ACTL. This algorithm uses an effective characterization of level 3/2 of the concatenation hierarchy for infinite words, also a new result.
Chapter PDF
Similar content being viewed by others
References
Arfi, M.: Polynomial operations on rational languages. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 198–206. Springer, Heidelberg (1987)
Arfi, M.: Opérations polynomiales et hiérarchies de concaténation. Theor. Comput. Sci. 91(1), 71–84 (1991)
Clarke, E.M., Draghicescu, I.A.: Expressibility results for linear-time and branching-time logics. In: REX Workshop, pp. 428–437 (1988)
Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)
Kamp, J.A.: Tense Logic and the Theory of Linear Order. PhD thesis, Univ. of California, Los Angeles (1968)
Maidl, M.: The common fragment of CTL and LTL. In: Foundations of Computer Science, pp. 643–652 (2000)
Perrin, D., Pin, J.-É.: Infinite Words. Elsevier, Amsterdam (2004)
Pin, J.-É., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems 30, 1–30 (1997)
Potthoff, A.: First-order logic on finite trees. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) TAPSOFT 1995. LNCS, vol. 915, pp. 125–139. Springer, Heidelberg (1995)
Simon, I.: Factorization forests of finite height. Theoretical Computer Science 72, 65–94 (1990)
Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences 25, 360–375 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bojańczyk, M. (2008). The Common Fragment of ACTL and LTL. In: Amadio, R. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2008. Lecture Notes in Computer Science, vol 4962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78499-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-78499-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78497-5
Online ISBN: 978-3-540-78499-9
eBook Packages: Computer ScienceComputer Science (R0)