Abstract:
We consider a representation of a finite automaton by a scheme in a basis consisting of strongly connected finite Mealy automata. We present a method for transforming any part of an arbitrary scheme into a subscheme for which diagnosis is possible using conditional tests with good localization of a wide class of faults that arise. We describe test sequences and obtain estimates for their lengths. We give upper bounds for the complexity of the transformed schemes.