Exercise 8.2 (Behavioral Model – Extended Traffic Light – Graph –

List of Phases). Create a behavioral model of a finite-state machine for the traffic light that extends the model of Fig. 8.1. Two input variables

(x1, x2) allow to control the extended traffic light. If x1 = 0, the traffic light behaves as shown in Fig. 8.1 which is the preferred mode for traffic in both directions. If x1 = 1 and x2 = 0, three additional green states are included before the state 1 for the strong traffic in direction to the town.

If x1 = 1 and x2 = 1, two additional green states are included before the state 9 for the strong traffic in direction out of the town. Practical tasks:

1 Draw the graph of the extended finite-state machine and extend the table of the required outputs.

2 How many variables are required to code the states.

3 Prepare a Boolean space which is large enough for the list of phases.
4 Define the list of phases as object number 1.
5 Add variable tuples for inputs as object number 2, state variables as object number 3, state variables for the following time step as object number 4, and outputs as object number 5. Store the TVL system as e8102.sdt for later use