Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits
- 1 October 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-16 (5), 567-580
- https://doi.org/10.1109/pgec.1967.264743
Abstract
Two algorithms are presented: one, DALG-II, computes a test to detect a failure in acyclic logic circuits; the other, TEST-DETECT, ascertains all failures detected by a given test. Both are based upon the utilization of a ``calculus of D-cubes'' that provides the means for effectively performing the necessary computations for very large logic circuits. Strategies for combining the two algorithms into an efficient diagnostic test generation procedure are given. APL specifications of the algorithms are given in an Appendix.Keywords
This publication has 9 references indexed in Scilit:
- Diagnosis of Automata Failures: A Calculus and a MethodIBM Journal of Research and Development, 1966
- On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic NetsIEEE Transactions on Electronic Computers, 1966
- An integrated approach to automated computer maintenancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965
- Techniques for the diagnosis of switching circuit failuresIEEE Transactions on Communication and Electronics, 1964
- Design of Serviceability Features for the IBM System/360IBM Journal of Research and Development, 1964
- A formal description of SYSTEM/360IBM Systems Journal, 1964
- A Computer Organization and Programming System for Automated MaintenanceIEEE Transactions on Electronic Computers, 1963
- Minimization over Boolean TreesIBM Journal of Research and Development, 1960
- Test Routines Based on Symbolic Logical StatementsJournal of the ACM, 1959