Equivalence and Dominance Relations Between Output Faults in Sequential Machines.

摘要

Output faults are defined as faults that affect only the output function of a sequential machine. For reduced and strongly connected machines,it is shown that equivalence between output faults that are not combinationally equivalent implies the existence of a nontrivial state table automorphism. This property can be generalized to nonreduced machines in many cases. Combinational dominance between output faults implies reset dominance,but not always vice versa. Necessary and sufficient conditions for reset dominance are derived,and an algorithm is presented to check these conditions. This constitutes an efficient procedure to determine reset dominance. (Modified author abstract)