Temporal Logic with Forgettable Past
نویسندگان
چکیده
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL+ Past (which in turn can be more succinct than LTL). We study satisfiability and model checking for NLTL and provide optimal automata-theoretic algorithms for these EXPSPACE-complete problems.
منابع مشابه
On the Complexity of Branching-Time Logics
We classify the complexity of the satisfiability problem for extensions of CTL and UB. The extensions we consider are Boolean combinations of path formulas, fairness properties, past modalities, and forgettable past. Our main result shows that satisfiability for CTL with all these extensions is still in 2EXPTIME, which strongly contrasts with the nonelementary complexity of CTL∗ with forgettabl...
متن کاملCaRet With Forgettable Past
We study the extension of the full logic CaRet with the unary regular modality N (which reads “from now on”) which allows to model forgettable past. For such an extension, denoted NCaRet, we show the following: (1) NCaRet is expressively complete for the first-order fragment of MSOμ, which extend MSO over words with a binary matching predicate, (2) satisfiability and pushdown model checking are...
متن کاملTemporal Modalities for Concisely Capturing Timing Diagrams
Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both partial orders on events and don’t-care regions to LTL potentially yields exponentially larger formulas containing several non-localized terms corresponding to the same event. This raises a more fundamental question: which...
متن کاملThe Forgettable-Watcher Model for Video Question Answering
A number of visual question answering approaches have been proposed recently, aiming at understanding the visual scenes by answering the natural language questions. While the image question answering has drawn significant attention, video question answering is largely unexplored. Video-QA is different from Image-QA since the information and the events are scattered among multiple frames. In ord...
متن کاملTemporal Logic with Past is Exponentially More Succinct
We positively answer the old question whether temporal logic with past is more succinct than pure-future temporal logic. Surprisingly, the proof is quite simple and elementary, although the question has been open for twenty years.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002