## An algorithm for developing near minimum cost sequential diagnostic procedures for combinational switching networks |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

AN UPPER BOUND ON THE NUMBER OF DIAGNOSABLE | 19 |

IDEAL TESTS FOR FAULT IDENTIFICATION | 25 |

AN ALGORITHM FOR THE DEVELOPMENT OF NEAR | 43 |

### Common terms and phrases

algorithm Appendix bound of Theorem combinational switching networks computed considered containing N DFC's cost of identifying developing an SDP distinguishable fault Effecting Only Output Excess-3 Fanout path fault class containing fault condition fault detection information fault detection matrix fault is present Faults Effecting Fig C.3 Fig D.l Fig greatest weight identical fault patterns increase in cost indistinguishable fault patterns input combination integer Kletsky Logical Diagram lower bound min-max minimum cost SDP network containing network inputs Network of Fig network outputs network when fault non-optimum test notation number of DFC's number of faults number of network number of possible number of tests optimum tests particular fault class questionable elements range function required to identify s-a-0 faults SDP's secondary weight sequential diagnostic procedure shown in fig test of greatest test patterns test selection test with respect tests required tests that detect thesis upper bound weighting scheme