More Accurate Polynomial-Time Min-Max Timing Simulation

We describe a polynomial-time algorithm for min-max timing simulation of combinational circuits. Our algorithm reports conservative bounds on the propagationdelays from each primary input to each gate, for use in the timing verification of fundamental-mode asynchronous circuits. A new reconvergent fanout analysis technique is presented. Our algorithm produces more accurate results than previous polynomial-time (and some exponential-time) algorithms in the presence of reconvergent fanouts. 1. Introduction Timing simulation is an important tool for highperformance asynchronous circuit design. However, statistical variations in IC processing conditions, operating conditions, etc., result in uncertainties in component delays which need to be taken into consideration when verifying timing-dependent circuit behavior, e.g., hazard-detection in asynchronous circuits. Timing simulation that considers component delays to vary within specified intervals and determines upper and lower bounds on ..