Abstract
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed by Sistla, extends LTL by quantifications over the atomic propositions. The expressive power of LTL and its fragments have been made relatively clear by numerous researchers. However, there are few results on the expressive power of QLTL and its fragments (besides those of LTL). In this paper we get some initial results on the expressive power of QLTL. First, we show that both Q(U) (the fragment of QLTL in which “Until” is the only temporal operator used, without restriction on the use of quantifiers) and Q(F) (similar to Q(U), with temporal operator “Until” replaced by “Future”) can express the whole class of ω-regular languages. Then we compare the expressive power of various fragments of QLTL in detail and get a panorama of the expressive power of fragments of QLTL. Finally, we consider the quantifier hierarchy of Q(U) and Q(F), and show that one alternation of existential and universal quantifiers is necessary and sufficient to express the whole class of ω-regular languages.
Partially supported by the National Natural Science Foundation of China under Grant No. 60223005 and the National Grand Fundamental Research 973 Program of China under Grant No. 2002cb312200.
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
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)
Etessami, K.: Stutter-invariant languages, ω-automata, and temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 236–248. Springer, Heidelberg (1999)
French, T., Reynolds, M.: A Sound and Complete Proof System for QPTL. Advances in Modal Logic 4, 127–147 (2003)
Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the Temporal Analysis of Fairness. In: POPL 1980. Conference Record of the 7th ACM Symposium on Principles of Programming Languages, pp. 163–173. ACM Press, New York (1980)
Kamp, H.W.: Tense Logic and the Theory of Linear Order. PhD thesis, UCLA, Los Angeles, California, USA (1968)
Kesten, Y., Pnueli, A.: A Complete Proof Systems for QPTL. In: LICS, pp. 2–12 (1995)
Perrin, D.: Recent results on automata and infinite words. In: Chytil, M.P., Koubek, V. (eds.) Mathematical Foundations of Computer Science 1984. LNCS, vol. 176, pp. 134–148. Springer, Heidelberg (1984)
Pnueli, A.: The temporal logic of programs. In: 18th FOCS, pp. 46–51 (1977)
Prior, A.N.: Time and Modality. Clarendon Press, Oxford (1957)
Peled, D., Wilke, T.: Stutter-invariant temporal properties are expressible without the next-time operator. Information Processing Letters 63, 243–246 (1997)
Sistla, A.P.: Theoretical issues in the design and verification of distributed systems. PHD thesis, Harvard University (1983)
Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. TCS 49, 217–237 (1987)
Sistla, A.P., Zuck, L.D.: Reasoning in a restricted temporal logic. Information and Computation 102, 167–195 (1993)
Thomas, W.: Star-free regular sets of ω-sequences. Inform. and Control 42, 148–156 (1979)
Thomas, W.: A combinatorial approach to the theory of ω-automata. Inform. and Control 48, 261–283 (1981)
Thomas, W.: Automata on Infinite Objects. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 133–191. Elsevier Science Publishers, Amsterdam (1990)
Vardi, M.Y.: A temporal fixpoint calculus. In: POPL’88. Proceedings of the 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 250–259 (1988)
Wolper, P.: Temporal logic can be more expressive. Inform. and Control 56, 72–99 (1983)
Vardi, M.Y., Wolper, P.: Yet another process logic. In: Clarke, E., Kozen, D. (eds.) Logics of Programs. LNCS, vol. 164, pp. 501–512. Springer, Heidelberg (1984)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Z. (2007). On the Expressive Power of QLTL. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-75292-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75290-5
Online ISBN: 978-3-540-75292-9
eBook Packages: Computer ScienceComputer Science (R0)