The monitoring of timing constraints on time intervals

Efficient algorithms have been developed by a number of authors to detect constraint violation or satisfaction of timed events. In extant work, the time of every event occurrence is assumed to be known exactly. However there are practical situations where we are not sure about the exact time of occurrence of an event but we may be able to capture the uncertainty by a time interval. In this paper we propose new types of timing constraints: possible and certain constraints that are pertinent to an event model where timestamps are given by time intervals. We extend previous work in timed event monitoring that is time-point based to our interval-based model. We give an efficient algorithm for monitoring timing constraints under event timing uncertainty, and sketch its proof of correctness by extending the pruning algorithm on the constraint graph to cover interval timestamps.