George Markowsky
Algebra Universalis
We show how to construct, in a simple manner, a test set having n + 1 tests for a fanout-free combinational circuit with n primary inputs which distinguishes (diagnoses) nonequivalent single faults. This result is an improvement over the upper bound in [1, Theorem 3.9] of n + g (g is the number of primary input gates) and the upper bound in [3, Theorem 4], [5] of 2n for the least number of tests required to distinguish among nonequivalent single faults. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.
George Markowsky
Algebra Universalis
George Markowsky
Discrete Mathematics
George Markowsky, Andrew Wohlgemuth
Mathematical Biosciences
Larry Carter, Robert Floyd, et al.
STOC 1978