Abstract
In this paper we present a new approach to solving the false path problem. The method is based on our previous work on Timed Boolean Calculus. Given a logic circuit, we first derive timed boolean expressions to model its dynamic behavior. Then, for each term in the expressions, we compute its corresponding sensitizability function, expressed in conjunction normal form; and use an expression in product form to approximate the function. Finally we remove the redundant terms whose sensitizability functions are not satisfiable and determine the maximal delays from the terms remained. Complexity analysis shows that our method identifies false paths and computes delays for sensitizable paths in polynomial time, while experimental results on ISCAS benchmark circuits prove its better efficiency and effectiveness.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
