Test Generation219100101011011011101100011010111001100101011011011110111000001011000FIGURE 4.41A distinguishing sequence that distinguishes states 11010 and 11000.afford to generate a distinguishing sequence for each possible state pair. Rather, thesearch may simply be on finding those distinguishing sequences that are applicablefor distinguishing many pairs of states. Using the above five-flip-flop circuit exampleagain, if a distinguishing sequence exists that can distinguish all pairs of states thatdiffer inff4, this sequence would be a powerful distinguishing sequence for manypairs of states. Although this type of distinguishing sequence can be computed priorto the start of test generation, such sequences may not exist for every flip-flop in thecircuit. Thus, less powerful distinguishing sequences are also captured during testgeneration dynamically. However, less powerful sequences may only be applicablewhen the circuit is in a specific state.In both DIGATE and STRATEGATE, distinguishing sequences are generated both
This is the end of the preview.
access the rest of the document.
Distinguish, Test Generation, distinguishing sequences