Using timed Boolean algebra to solve false path problem in timing analysis

A new approach to the false path problem is proposed. The approach is based on an extended Boolean algebra and is capable of modeling the logic and timing behavior of logic networks in terms of modified Boolean functions. By applying algebraic manipulations, the approach can extract correct path delays as well as the input vectors for activating the sensitizable paths.<
>