An NP-Complete Fragment of LTL

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.

[1]  Nicolas Markey.  Past is for free: on the complexity of verifying linear temporal properties with past , 2003, Acta Informatica.

[2]  Igor Walukiewicz.  Difficult Configurations—On the Complexity of LTrL , 2005, Formal Methods Syst. Des..

[3]  Philippe Schnoebelen,et al.  Model Checking a Path , 2003, CONCUR.

[4]  Kousha Etessami,et al.  Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997 , 1997, LICS.

[5]  Dominique Perrin,et al.  On the Expressive Power of Temporal Logic , 1993, J. Comput. Syst. Sci..

[6]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[7]  Kousha Etessami,et al.  First-order logic with two variables and unary temporal logic , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[8]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[9]  Thomas Wilke,et al.  Classifying Discrete Temporal Properties , 1999, STACS.

[10]  Philippe Schnoebelen,et al.  The Complexity of Temporal Logic Model Checking , 2002, Advances in Modal Logic.

[11]  Clare Dixon,et al.  Execution and Proof in a Horn-Clause Temporal Logic , 2000 .

[12]  Philippe Schnoebelen,et al.  The Complexity of Propositional Linear Temporal Logics in Simple Cases , 1998, Inf. Comput..

[13]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .