Access the full text.
Sign up today, get DeepDyve free for 14 days.
f) (k + 1 ) patterns are necessary and sufficient to test a net composed solely of any one of these functions for I (I')
D. Richards (1973)
Efficient Exercising of Switching Elements in Combinatorial NetsJ. ACM, 20
G. Hornbuckle, R. Spann (1969)
Diagnosis of Single-Gate Failures in Combinational circuitsIEEE Transactions on Computers, C-18
W. Kautz (1968)
Fault Testing and Diagnosis in Combinational Digital CircuitsIEEE Transactions on Computers, C-17
d) n accepts p (I', k + 1) based on f = nor (by duality)
(1970)
Fault Diagnosis of Digital Systems Wiley- Interscience
T. Powell (1969)
A Procedure for Selecting Diagnostic TestsIEEE Transactions on Computers, C-18
(1973)
Journal of the Assoclatlon for Computing Machinery
(1967)
The Four-Color Graph Problem
c) n accepts p(I, k + 1) based onf = xor (by identical definition
Test size and optimum detection in switching nets
(1969)
Diagnosm of single-gate failuresin combinational circuits
J. Roth (1966)
Diagnosis of automata failures: a calculus and a methodIbm Journal of Research and Development, 10
(1961)
Journal of the Association for Computing MachineryNature, 190
e) n accepts p(l', k -~-1) based onf = xand (by identical definition with nor)
J. Roth, W. Bouricius, P. Schneider (1967)
Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic CircuitsIEEE Trans. Electron. Comput., 16
K. Maling, E. Allen (1963)
A Computer Organization and Programming System for Automated MaintenanceIEEE Trans. Electron. Comput., 12
Rakesh Sinha, Oly Rajak, Subhashis Chandra (2011)
PROGRAMMING LANGUAGE
E: For this test we obtain results for a particular k only
Efficient Exercising of Switching Elements in Nets of Identical Gates D O N A L D L. R I C H A R D S * ABSTRACT. The problem of finding a m i n i m u m n u m b e r of p a t t e r n s to exercise the logic elem e n t s of a c o m b i n a t i o n a l switching n e t is investigated. T h r o u g h o u t , the w o r d " t e s t i n g " refers to exercising of this k i n d ; or, equivalently, to fault dlagnosm where each line of the net can be directly observed. Any set of p e r m a n e n t faults can be selected to t e s t against, examples of which range from " s t u c k - a t " faults (allowing the most economical test) to " a n y possible f a u l t " (requiring the m o s t complete test). The
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Jan 1, 1973
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.