A structure of representations of definitely-diagnosable automata

Representations of finite automata are considered. Checking experiments and related notions are the special cases of these representations. A criterion of “being of a representations for definitely-diagnosable order 1 automata” is obtained. All minimal representations for this case are described.