On the expressive power of QLTL

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

LTL cannot express the whole class of w-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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Wu, Z. (2007). On the expressive power of QLTL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4711 LNCS, pp. 467–481). Springer Verlag. https://doi.org/10.1007/978-3-540-75292-9_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free