The power of first-order quantification over states in branching and linear time temporal logics

Authors:
Krishnendu Chatterjee;Pallab Dasgupta;P. P. Chakrabarti
Affiliations:
Department of EECS UC Berkeley;Department of Computer Science & Engineering, Indian Institute of Technology, Kharagpur 721302 India;Department of Computer Science & Engineering, Indian Institute of Technology, Kharagpur 721302 India
Venue:
Information Processing Letters
Year:
2004

Citing 3
Cited 0

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
CTL and ECTL as fragments of the modal &mgr;-calculus

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract)

Proceedings of the 12th Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we investigate the power of extending first-order quantification over states to branching and linear time temporal logics. We show that an unrestricted extension significantly enriches the expressive power of µ-calculus, but also leads to a significant jump in model checking complexity. However, by restricting the scope of the extension, we are able to present a powerful extension of µ-calculus that is richer than µ-calculus, but is in the same complexity class as µ-calculus in terms of model checking complexity. In the case of linear time temporal logic, we find that first-order quantification over states is more computationally expensive. We show that even under the most restricted scope of quantification, the program complexity of model checking linear temporal logic (LTL) is NP-hard and coNP-hard. However, we also show that model checking LTL with this generic extension remains PSPACE-complete.