Different classes of diagnosable systems: relationship and common diagnosis algorithm

In the literature on diagnosable systems it has been shown that several subclasses of systems that can be diagnosed more efficiently than the general case exist. Some of these subclasses are D(n.t,X) systems introduced by K.Y. Chwa et al. (1981), self-implicating systems (A.T. Dahbura et al., 1985), and systems with connection assignment digraph of node connectivity t (G.F. Sullivan, 1978, S.L. Hakimi et al., 1974). The relationship between these classes is investigated and a diagnosis algorithm that is applicable to systems belonging to any of these classes is formulated. >

[1]  Ralph Tindell,et al.  The Connectivities of a Graph and Its Complement1 , 1982 .

[2]  Gerald M. Masson,et al.  An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems , 1984, IEEE Transactions on Computers.

[3]  Ralph Tindell,et al.  Circulants and their connectivities , 1984, J. Graph Theory.

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

[5]  Kyung-Yong Chwa,et al.  On Fault Identification in Diagnosable Systems , 1981, IEEE Transactions on Computers.

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

[7]  G. F. Sullivan,et al.  An O(t3 + |E|) Fault Identification Algorithm for Diagnosable Systems , 1988, IEEE Trans. Computers.

[8]  Che-Liang Yang,et al.  Self-Implicating Structures for Diagnosable Systems , 1985, IEEE Transactions on Computers.

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

[10]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .