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

1.6k comments

546 users

0 votes

Exam problem : 14.02.2018 8 (f) : *2018.02.14.vrs.solutions.pdf (uni-kl.de)

I just want to clarify about my understanding.

I came up with below solution which satisfies S2 and not S1 :

In S2, [a WB b] should hold because a is true in first place and hence as [a WB b] is true so the whole formula is true as c never holds.

In S1, a is true at first and as b and c never holds so in weak before [0 WB 0] results in true and hence both a and [b WB c] coexist hence it is not satisfied.

I also checked with tool :

G (a&!b&!c) -> (([[a WB b] WB c]) & !([a WB [b WB c]]))  results Valid.

But I just wanted to know whether my understanding as described as above is correct or not.

Thanks in advance 

in * TF "Emb. Sys. and Rob." by (2.9k points)

1 Answer

+1 vote
 
Best answer
You are right with all you wrote. Perfect!
by (166k points)
selected by
Thanks a lot for the verification.

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
asked Aug 24, 2022 in * TF "Emb. Sys. and Rob." by CS_E (2.9k points)
0 votes
2 answers
asked Jan 15, 2021 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
Imprint | Privacy Policy
...