Exercise 8.7 (Partial Behavior of a Sequential Circuit). Calculate several partial behaviors of the sequential circuit of Fig. 8.2. The global list of phases of this finite-state machine is available as object 7 in the solution of Exercise 8.5. This solution includes additionally variable tuples for inputs as object 2, variables of the states as object 3, variables of the states at the following time step as object 4, and outputs as object 5. Minimize the number of rows in the solution only, but not the fixed demand information.

Practical tasks:

1 Load the final TVL system of Exercise 8.5.

2 Calculate the partial behaviors for all four possible input patterns.

3 How many and which states can be reached in the following time step starting form the states (s1, s2, s3) equal to (000), (100), and (101).

4 From how many and which states it is possible to reach the states

(sf1, sf2, sf3) equal to (000), (100), and (101) in the following time step.

5 Are there states which can not be reached?