Question

Give me the answer by showing me the tree of 21 reachable states label the tree states like 1 1 F F A The book gives claim that there are only 21 reachable states in the system with 128 states and that a state of the type (4,4,.....) is not among those 21. in System and Software Verification book there is a claim: if I have 2 systems A and B As you see in those two images there are A and B systems have 4 states in both, and rA take two values T or F and, rB also take two values T or F, and turn take two values A or B. the synch Product will be : A * B * rA * rB * turn ====> 4 * 4 * 2 * 2 * 2 =128 states

ch wil,--be tur be couyey

Answer 1

A's system: - B's system: - Above content why we use 2, 1, T, F, A. There is no such path in the above given two graphs. Please check is once and we take initial state is (1, 1, F, F, A) 1,1,F,F,A 1,2,T,F,A 2,3,T,F,B 1,3,T,F,B 3,4,T,F,A 1,4,F,F,B 2,2,F,F,A 1,2,F,T,B 1,3,F,T,A 2,3,F,T,A 3,3,F,F,A 3,4,F,T,B 1,1,T,T,B 4,1,T,F,A 1,4,F,T,A 3,1,F,F,B 2,2,T,T,B 4,1,F,F,B 2,4,F,T,B 3,3,T,T,B 2,4,T,F,A Above states are defined by the given above directed graph.

1)1,1,F,F,A

2)1,2,T,F,A

3)2,3,T,F,B

4)1,3,T,F,B

5)3,4,T,F,A

6)1,4,F,F,B

7)2,2,F,F,A

8)1,2,F,T,B

9)1,3,F,T,A

10)2,3,F,T,A

11)3,3,F,F,A

12)3,4,F,T,B

13)1,1,T,T,B

14)4,1,T,F,A

15)1,4,F,T,A

16)3,1,F,F,B

17)2,2,T,T,B

18)4,1,F,F,B

19)2,4,F,T,B

20)3,3,T,T,B

21)2,4,T,F,A

Above states are defined by the given above directed graph.