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

1.1k questions

1.2k answers


543 users

+1 vote
Please explain how to get the answer to Feb 2018 11. a). Thank you.
in * TF "Emb. Sys. and Rob." by (350 points)

1 Answer

+2 votes
Best answer

The given transition relation is (a∧b∧a′∧b′) ∨ ¬(a∧b)∧¬(a′∧b′)∧(c↔c′)∧(a⊕a′)∧(b′⊕b′). Since b′⊕b′ is equivalent to false, the entire second disjunct becomes also false, so that the transition relation is equivalent to (a∧b∧a′∧b′). Now the states of the Kripke structure consist of the variable assignments for {a,b,c}, i.e., eight states where we only have transitions from {a,b} and {a,b,c} to these states themselves, i.e.:

by (166k points)
edited by
Thank you sir.
Imprint | Privacy Policy