An Efficient Algorithm for Generating Complete Test Sets for Combinational Logic Circuits
From MaRDI portal
Publication:5641077
DOI10.1109/T-C.1971.223123zbMath0232.94016MaRDI QIDQ5641077
Publication date: 1971
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items (4)
An efficient algorithm for calculating Boolean difference ⋮ Complete test-set generation for bridging faults in combinational-logic circuits ⋮ An efficient algorithm for single and multiple fault test sets generation ⋮ A graph-theoretic multiple logic fault analysis through petri-nets
This page was built for publication: An Efficient Algorithm for Generating Complete Test Sets for Combinational Logic Circuits