Algorithms for timing requirement analysis and generation
Steven K. Sherman · Design Automation Conference · 1988
Timing requirement analysis removes ambiguity from specifications and generates results for use in other simulations of digital systems. It involves construction of a graph representing all constraints between state transitions and the generation of an optimized graph having a maximum number of simultaneous constraints. Optimization involves prioritizing the constraints or searching for a solution which violates no constraints.