Interval-Based Timing Constraints Their Satisfactions and Applications
Yu, Yue; Ren, Shangping; Frieder, Ophir
Computers, IEEE Transactions on
Volume 57, Issue 3, March 2008 Page(s):418 - 432
Digital Object Identifier   10.1109/TC.2007.70807
Summary:In real systems, an error range (±Δ) is often given to a time stamp (t) for an observed event. Such practice implicitly states that the event happens anytime in the interval [t-Δ1, t+Δ2]. Hence, constraints based on intervals are more realistic. However, when a constraint is extended from a point to an interval, its satisfaction is not a simple Boolean value; instead, a probability is associated with the constraint. We study the satisfaction probability of interval-based timing constraints when event occurrence is non-uniformly distributed in a given time interval. An algorithm is developed to derive implicit constraints from a set of given interval-based constraints. Our study shows that there are bounds for certain constraint configurations. These analytical results are further applied in two application domains in which constraints are based on single and multiple event models, respectively.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.