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 propagation delays 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.