13 search results - page 1 / 3 » Ultimately Periodic Simple Temporal Problems (UPSTPs) |
TIME
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
CONCUR
2003
Springer
14 years 4 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
FM
2009
Springer
14 years 5 months ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
SEFM
2009
IEEE
14 years 5 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
CIKM
2010
Springer
13 years 9 months ago
2010
Springer
This paper describes an algorithm for determining if an event occurs persistently within an interval where the interval is periodic but the event is not. The goal of the algorithm...