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.<
>