On the expressive power of QLTL

Authors:
Zhilin Wu
Affiliations:
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China and Graduate School of the Chinese Academy of Sciences, Beijing, China
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 12
Cited 0

“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
The complementation problem for Bu¨chi automata with applications to temporal logic

Theoretical Computer Science
A temporal fixpoint calculus

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Reasoning in a restricted temporal logic

Information and Computation
Stutter-invariant temporal properties are expressible without the next-time operator

Information Processing Letters
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Recent Results on Automata and Infinite Words

Proceedings of the Mathematical Foundations of Computer Science 1984
Yet Another Process Logic (Preliminary Version)

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
A Complete Proof Systems for QPTL

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Theoretical issues in the design and verification of distributed systems

Theoretical issues in the design and verification of distributed systems
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.