Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.2k questions

1.3k answers

1.7k comments

595 users

0 votes
What if we were checking  the reverse K2<= k1?

Would that also be the same? we still consider the deadend states?

Best Regards,
ago in * TF "Emb. Sys. and Rob." by (530 points)

1 Answer

0 votes

For the reverse, we consider again the diagrams, but have to find for each state in the lower successor set a related one in the upper successor set. Now consider the following diagram:

    S2 --> {}
    |     
    Q1 --> {Q3}
We therefore have to find for Q3 are related state in {} which obviously does not exist. So, we would remove the pair (S2,Q1) if we would check for bisimulation or the reverse simulation.
ago by (172k points)
Imprint | Privacy Policy
...