Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

DLT
2004

favoriteEmaildiscussreport

77views Theoretical Computer Science» more DLT 2004»

An NP-Complete Fragment of LTL

13 years 6 months ago

An NP-Complete Fragment of LTL

Download www.labri.fr

A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NPcomplete. 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.

Anca Muscholl, Igor Walukiewicz

Real-time Traffic

DLT 2004 | DLT 2007 | NP-complete Fragments | Satisfiability Problem | Time Temporal Logic |

claim paper

Related Content

» Characteristic Patterns for LTL

» From structured english to robot motion

» Translating Structured English to Robot Controllers

» Timed Concurrent Constraint Programming Decidability Results and Their Application to LTL

» From PSL to LTL A Formal Validation in HOL

» The Tractability of ModelChecking 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

» The Common Fragment of CTL and LTL

» On Decidability of LTL Model Checking for Process Rewrite Systems

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2004
Where	DLT
Authors	Anca Muscholl, Igor Walukiewicz

Comments (0)