ON A GENERALIZATION OF THE SELF-IMPLICATING STRUCTURES IN DIAGNOSABLESYSTEMS

It is known that among the diagnosable systems modeled as in PMC model , there exist several subclasses of systems that can be diagnosed more efficiently than the general case. Some of these subclasses are D(n, t, X) systems, self-implicating systems, systems having connection ass ignment digraph of node connectivity t and so on. It has been shown in the literature that some of these classes are unrelated. An obvious q uestion is: does there exist any class of systems that subsumes all th ese subclasses? In this paper, we have found an affirmative answer to this question. We present a generalization of the self-implicating str ucture and show that this generalized class subsumes all these subclas ses. We find a characterization of this new class and find an efficien t diagnosis algorithm.