A new approach to solving false path problem in timing analysis

A novel approach to solving 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, one can use this approach to extract correct timing information such as path delays as well as the input vectors to activate the sensitizable paths. There are two innovative ideas involved in the approach: (1) an algebraic method is used to deal with the problem of delay analysis, and (2) the rising and falling delays of each node are extracted separately. The approach has been implemented and tested on ISCAS benchmarks.<>