An NP-Complete fragment of LTL

Authors:
Anca Muscholl;Igor Walukiewicz
Affiliations:
LIAFA, Université Paris, Paris, France;LaBRI, Université Bordeaux-1, France
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 8
Cited 0

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Modalities for model checking: branching time logic strikes back

Science of Computer Programming
Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The complexity of propositional linear temporal logics in simple cases

Information and Computation
Difficult Configurations - On the Complexity of LTrL

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
First-Order Logic with Two Variables and Unary Temporal

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Past is for free: on the complexity of verifying linear temporal properties with past

Acta Informatica
Classifying discrete temporal properties

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NP-complete. The fragment is larger than previously known NP-complete fragments. It is obtained by prohibiting the use of until operator and requiring to use only next operators indexed by a letter.