Checking p-t diagnosability of a system

In this paper the probabilistic measure of diagnosability, p-t diagnosability, originally proposed in [11], is used to study the diagnosability of digital systems. The system is represented by the graph theoretic model and assuming that failure probability of each unit is a priori known, a new necessary and sufficient condition has been proposed to check the p-t diagnosability of the system.

[1]  Kozo Kinoshita,et al.  On the Computational Complexity of System Diagnosis , 1978, IEEE Transactions on Computers.

[2]  C. V. Ramamoorthy,et al.  Analysis of Graphs by Connectivity Considerations , 1966, J. ACM.

[3]  Tiko Kameda,et al.  An Approach to the Diagnosability Analysis of a System , 1975, IEEE Transactions on Computers.

[4]  S. Louis Hakimi,et al.  On Models for Diagnosable Systems and Probabilistic Fault Diagnosis , 1976, IEEE Transactions on Computers.

[5]  Tiko Kameda,et al.  A Diagnosing Algorithm for Networks , 1975, Inf. Control..

[6]  Kozo Kinoshita,et al.  Connection Assignments for Probabilistically Diagnosable Systems , 1978, IEEE Transactions on Computers.

[7]  Kozo Kinoshita,et al.  Some Existence Theorems for Probabilistically Diagnosable Systems , 1978, IEEE Transactions on Computers.

[8]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[9]  C. V. Ramamoorthy,et al.  Computer Diagnosis Using the Blocking Gate Approach , 1971, IEEE Transactions on Computers.

[10]  D. H. Rutherford,et al.  A self-diagnosable computer , 1965, AFIPS '65 (Fall, part I).

[11]  N. Seshagiri.  Completely self-diagnosable digital systems , 1971 .

[12]  S. Louis Hakimi,et al.  Characterization of Connection Assignment of Diagnosable Systems , 1974, IEEE Transactions on Computers.