An algorithm for asynchronous NMOS/CMOS network analysis in a CAD tool for physical fault simulation

Abstract

This paper describes an algorithm for the determination of a minimal feedback vertex set in a directed graph. The algorithm has been developed starting from a new concept of knowledge propagation algebra, and uses both heuristic choices and computation of lower bounds in order to limit the search time. It is currently inserted in a tool for physical fault simulation, where it is used for the individuation of state variable sets in MOS circuits. The run-time results obtained are good and particularly suitable for the above mentioned application of the algorithm.