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

912 questions

1k answers

1.4k comments

441 users

0 votes

could you explain what I am doing wrong

related to an answer for: exercise sheet 5 question 1
in * TF "Emb. Sys. and Rob." by (300 points)

1 Answer

+1 vote
Remove the deadend initial states (as done in a)), then get the reachable states (b)), and after that clear the transition relation from deadends (c)) and unreachable states (d)).
by (25.6k points)
thanks I was able to solve (b) with your help but I have a question regarding the format for (c) and (d) next(p) and next(q) will be true when there is a transition from to a state that has p true and q true is this right ?
Right! For the transition relation, you double all variables. You then have un-primed and primed variables. Each assignment corresponds to a pair of a state (un-primed variables) and a next state (primed variables). There exists a transition from the state to the next state iff the assignment is a satisfying assignment of the transition relation formula.

Related questions

+1 vote
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...