Synthesis Procedure for Fully-Testable Non-Scan Finite-State Machines
Given a state-transition graph (STG) of a FSM, a 100%-testable logic-level implementation of the machine is produced
m No scannable latches required
m Uses partitioned logic approach and constrained state assignment