1 (379)

Prévia do material em texto

Step 1 of 1 7.088E Refer to Figure X7.88 from the textbook for the adjacency diagram resulted from the general solution for obtaining a race-free state assignment of 2" states using state variables for the n=2 case. This requires two hops for each input change. Refer to Figure 7-91 from the textbook for the worst-case scenario of four-state adjacency diagram and the assignment using pairs of equivalent states. It is faster and requires one hop for each input change. On the other hand, Figure 7-91 cannot be generalized for