Skip to main content
Journal Article

An NP-complete fragment of LTL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3340 334-344
DOI: 10.1007/978-3-540-30550-7_28
2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Muscholl, A., & Walukiewicz, I. (2004). An NP-complete fragment of LTL. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3340, 334–344. https://doi.org/10.1007/978-3-540-30550-7_28

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