The Community for Technology Leaders
Green Image
Issue No. 03 - March (1978 vol. 27)
ISSN: 0018-9340
pp: 280-283
H. Fujiwara , Department of Electronic Engineering, Osaka University
ABSTRACT
This correspondence is concerned with probabilistic fault diagnosis for digital systems. A graph-theoretic model of a diagnosable system introduced by Preparata et al.[3] is considered in which a system is made up of a number of units with the probability of failure. The necessary and sufficient conditions are obtained for the existence of testing links (a connection) to form probabilistically t-diagnosable systems with and without repair. Methods for connection assignments are given for probabilistic fault diagnosis procedures with and without repair. Maheshwari and Hakimi [10] gave the necessary and sufficient condition for a system to be probabilistically t-diagnosable Without repair. In this correspondence, we show the necessary and sufficient condition for a system to be probabilistically t-diagnosable with repair.
INDEX TERMS
testing links, Automatic diagnosis, connection assignments, digital systems, graphs, probabilistic fault diagnosis, self-diagnosable systems
CITATION
K. Kinoshita, H. Fujiwara, "Connection Assignments for Probabilistically Diagnosable Systems", IEEE Transactions on Computers, vol. 27, no. , pp. 280-283, March 1978, doi:10.1109/TC.1978.1675087
100 ms
(Ver )