The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments

Details The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments

2008-05-05

arxiv.org/abs/0805.0498v1

Computer Science

Logic in Computer Science

27 pages, 7 figures

Scientific paper

In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem 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 systematically studies the model-checking problem for LTL formulae over restricted sets of propositional and temporal operators. For almost all combinations of temporal and propositional operators, we determine whether the model-checking problem is tractable (in P) or intractable (NP-hard). We then focus on the tractable cases, showing that they all are NL-complete or even logspace solvable. This leads to a surprising gap in complexity between tractable and intractable cases. It is worth noting that our analysis covers an infinite set of problems, since there are infinitely many sets of propositional operators.

Affiliated with

Also associated with

No associations

Rating

The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments 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 Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208712