Promela Modeling Question: Hello, I am working with Promela (Spin) and need help..

I need answers for:

1. A and B

2. A

Please give an actual answer not a guide about Promela. Also please mark next to each answer which part it is for.

I have posted screenshots of the questions and models below:

thank you.

Tasks 1. Consider the state machines shown in Figure 3.10 and 3.111. variable count: 0,... 60) inputs: pedestrian pure Count 60 outputs sigR, sigG, sigY pure count count 1 count 60 sigG green pedestrian A count 60 count 0 count count 1 count count 1 red pedestrian Acount 60 sigY (pending count count count 0 count: 0 Count 600 sigY count 5 sigR yellow count 0 count 0 count 1 count Figure 3.10: Extended state machine model of a traffic light controller that keel track of the passage of time, assuming it reacts at regular intervals. inputs sigR, sigG, sigY pure outputs: pedestrian pure true true pedestrian waiting none sigG Crossing Figure 3.11 Nondeterministic model of pedestrians that arrive at a crosswalk. (a) Build a Promela model consisting of two processes, one for each state machines (b) Create properties for the above Promela model requiring that i. Pedestrians are allowed to cross the street only when the traffic light is red. ii. Pedestrians, if some appear, are always allowed to cross the street eventually. (c) Use SPIN to veri the Promela model against the properties, and make sure neither is violated. Tasks 1. Consider the state machines shown in Figure 3.10 and 3.111. variable count: 0,... 60) inputs: pedestrian pure Count 60 outputs sigR, sigG, sigY pure count count 1 count 60 sigG green pedestrian A count 60 count 0 count count 1 count count 1 red pedestrian Acount 60 sigY (pending count count count 0 count: 0 Count 600 sigY count 5 sigR yellow count 0 count 0 count 1 count Figure 3.10: Extended state machine model of a traffic light controller that keel track of the passage of time, assuming it reacts at regular intervals. inputs sigR, sigG, sigY pure outputs: pedestrian pure true true pedestrian waiting none sigG Crossing Figure 3.11 Nondeterministic model of pedestrians that arrive at a crosswalk. (a) Build a Promela model consisting of two processes, one for each state machines (b) Create properties for the above Promela model requiring that i. Pedestrians are allowed to cross the street only when the traffic light is red. ii. Pedestrians, if some appear, are always allowed to cross the street eventually. (c) Use SPIN to veri the Promela model against the properties, and make sure neither is violated