The Complexity of Generalized Satisfiability for Linear Temporal Logic

Details The Complexity of Generalized Satisfiability for Linear Temporal Logic The Complexity of Generalized Satisfiability for Linear Temporal Logic

2008-12-28

arxiv.org/abs/0812.4848v3

LMCS 5 (1:1) 2009

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-5(1:1)2009

In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper undertakes a systematic study of satisfiability for LTL formulae over restricted sets of propositional and temporal operators. Since every propositional operator corresponds to a Boolean function, there exist infinitely many propositional operators. In order to systematically cover all possible sets of them, we use Post's lattice. With its help, we determine the computational complexity of LTL satisfiability for all combinations of temporal operators and all but two classes of propositional functions. Each of these infinitely many problems is shown to be either PSPACE-complete, NP-complete, or in P.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Generalized Satisfiability for Linear Temporal Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Generalized Satisfiability for Linear Temporal Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Generalized Satisfiability for Linear Temporal Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-448460