由于传统的组合电路测试方法 ,如 D算法、PODEM算法和 FAN算法等 ,在搜索过程中都不可避免地要进行反向回溯 ,因此严重地影响了算法的效率。而 OBDD是一种表示和操纵布尔函数的有效方法 ,用 OBDD来表示电路中每个节点所代表的逻辑函数 ,可以把反向回溯过程转换为 OBDD的 satisfiability问题 ,从而避免了反向回溯过程 ,加快了故障测试的速度。同时 ,OBDD在测试矢量集的生成以及 necessary assignment的确定中也显示出一定的优越性。 Due to the traditional combinational circuit testing methods, such as D algorithm, PODEM algorithm and FAN algorithm, it is inevitable to backtrack during the search process, thus seriously affecting the efficiency of the algorithm. However, OBDD is an effective way to represent and manipulate Boolean functions. Using OBDD to represent the logic function represented by each node in the circuit, the backtracking process can be converted into the satisfiability problem of OBDD, thus avoiding the backtracking process. Speed ​​up fault testing. At the same time, OBDD also shows some advantages in the generation of test vector sets and the determination of necessary assignments.