The Community for Technology Leaders
Design Automation Conference (1988)
Anaheim, CA, USA
June 12, 1988 to June 15, 1988
ISBN: 0-8186-0864-1
pp: 724-727
Sherman , Digital Equipment Corp., Maynard, MA, USA
ABSTRACT
The author introduces timing requirement analysis and two algorithms for its implementation. The first uses a prioritization scheme to generate an approximate solution, which may result in violation. The second uses a depth-first search to find a solution that does not result in violation. Together, these algorithms are useful for timing-requirement analysis and generation and in pattern-timing generation.
INDEX TERMS
logic design verification, optimised graph, timing requirement analysis, prioritization scheme, depth-first search, pattern-timing generation
CITATION

Sherman, "Algorithms for timing requirement analysis and generation," Design Automation Conference(DAC), Anaheim, CA, USA, 1988, pp. 724-727.
doi:10.1109/DAC.1988.14851
98 ms
(Ver 3.3 (11022016))