CONCURRENTLY SELF-CHECKING STRUCTURES FOR FSMS

Design of concurrently self-checking Finite-State Machines is taken into account, with the aim of obtaining a fault coverage as high as possible (within a given fault model) while keeping the modified structure reasonably simple. A code-based approach is presented, suitable for unidirectional faults. It is seen that simple restrictions to synthesis of the combinatorial network (in the case of random logic) allow to consider such a fault model as acceptable, while there are no constraints if PLAs are used. In particular, a solution based on a modified Berger code is discussed, and results obtained for a set of benchmark FSMs are considered. A simplified. structure is further introduced.