Derivation of Minimal Test Sets for Monotonic Logic Circuits
暂无分享,去创建一个
It is shown that the number of maximal false vertices and minimal true vertices is the minimum number of tests required to detect all s-a-1 and s-a-0 faults in any irredundant two-level realization of a 2-monotonic function.
[1] Zvi Kohavi,et al. Detection of Multiple Faults in Combinational Logic Networks , 1972, IEEE Transactions on Computers.
[2] C. L. Sheng. Introduction to switching logic , 1972 .
[3] Saburo Muroga,et al. Threshold logic and its applications , 1971 .
[4] Rodolfo Betancourt. Derivation of Minimum Test Sets for Unate Logical Circuits , 1971, IEEE Transactions on Computers.