Sciweavers

909 search results - page 32 / 182
» Temporal Logic Case Study
Sort
View
ACTA
2004
97views more  ACTA 2004»
13 years 8 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey
TIME
2005
IEEE
14 years 2 months ago
Version Management and Historical Queries in Digital Libraries
Historical information can be effectively preserved using XML and searched through powerful historical queries written in XQuery. Indeed, by storing the successive versions of a d...
Fusheng Wang, Carlo Zaniolo, Xin Zhou, Hyun J. Moo...
CAV
2010
Springer
172views Hardware» more  CAV 2010»
14 years 21 days ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
LOGCOM
2007
91views more  LOGCOM 2007»
13 years 8 months ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 9 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...