作者: D. H. Du , S. H. Yen , S. Ghanta
DOI: 10.1145/74382.74475
关键词:
摘要: The false path problem is often referred to as the of detecting longest sensitizable (A which not a path). term “false path” clearly defined. In this paper, we first give clear and precise definition path. Then general formulated. detect whether given (not necessarily one) We present an efficient algorithm for solving problem. also propose another generates all possible paths with delays greater than threshold T. efficiency effectiveness proposed are demonstrated by experimental results.Index Terms: Timing Verification, Logic Simulation, VLSI circuit, Analysis, False path, Graph Theory.