Efficient Algorithms for Interface Timing Verification

摘要

This paper presents algorithms for computing separations between events that are constrained to obey prespecified relationships in their relative time of occurrence. The algorithms are useful for interface timing verification, where event separations are checked against timing requirements. The first algorithm computes separations when only linear and max constraints exist. The algorithms must converge to correct maximum existence of infinite constraint bounds or infinite event separations.