0 votes

Hello all,

In the following question, how would I solve it by "sharp looking"? The logic I used is:

All the paths from each state should eventually reach the loop s1,s2,s5. The answer I get is {s7}. Is this correct?

in * TF "Intelligent Systems" by (640 points)

1 Answer

+1 vote
 
Best answer
You first consider EGa which are the states that have an outgoing infinite path where a holds. Thus, just consider the a-states {s0;s1;s2;s5;s7} and try to find such path starting in these states. Clearly, the cycle s2->s1->s5->s2 is such a path and shows that these state belong to EGa. Also s0 can join this cycle with s0->s5, however, s7 has no outgoing transition and does not satisfy this. Hence, we found that EGa is {s0;s1;s2;s5}.

AF{s0;s1;s2;s5} are the states where all outgoing paths (if any) will eventually reach one of the states {s0;s1;s2;s5}. This is immediate for states {s0;s1;s2;s5}, and it is easy to see that the rest does also have transitions to this set (and s7 does not have infinite outgoing paths and therefore also satisfies this).
by (91.8k points)
selected by
Thank you for the explanation.

Related questions

0 votes
1 answer
asked Feb 6 in * TF "Emb. Sys. and Rob." by dn (1.4k points)
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
asked Aug 13, 2020 in * TF "Intelligent Systems" by malaMahadevu (350 points)
Imprint | Privacy Policy
...