Upper and lower bounds are obtained on the minimum length of tests detecting single and multiple stuck-at-0 and stuck-at-1 faults at input/output terminals of combinational logic networks realizing monotone Boolean functions of n variables. >
['Valery A. Vardanian']
On the complexity of terminal stuck-at fault detection tests for monotone Boolean functions