### Abstract

An algorithm for generating the complete test set of each stuck-at-0 (s-a-0) and stuck-at-1 (s-a-1) single fault in a combinational logic circuit is presented. The algorithm has been programmed to handle large circuits and is based on some properties of Boolean differences that make the generation of the complete test set very efficient. This algorithm can be modified so that it can be programmed on computers with small storage space. The modified algorithm can efficiently generate a subset of the complete test set of each of the faults under consideration. Some discussion is given to provide some insight into the relationship among undetectable faults, tests for detectable single faults, and circuit redundancies. Some ideas on the construction of test sets for detecting multiple faults based on Boolean differences are presented.

Original language | English (US) |
---|---|

Pages (from-to) | 1245-1251 |

Number of pages | 7 |

Journal | IEEE Transactions on Computers |

Volume | C-20 |

Issue number | 11 |

DOIs | |

State | Published - Nov 1971 |

### Fingerprint

### Keywords

- Algorithms Boolean difference combinational logic circuits complete test sets redundancies single faults and multiple faults storage stuck-at-0 (s-a-0) and stuck-at-1 (s-a-1)
- undetectable faults

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics

### Cite this

*IEEE Transactions on Computers*,

*C-20*(11), 1245-1251. https://doi.org/10.1109/T-C.1971.223123