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

1.1k questions

1.3k answers

1.7k comments

557 users

0 votes

Hello,

I wanted to confirm, Is the below solution correct?. I am trying to violate S1 as S2 is always true. 

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

1 Answer

0 votes

You are right. The second formula is always true. The first formula needs to be not satisfied. This can be done by having a path that (from the third step on) shows both a at some point and ¬a at some other point. Alternating between these two states is an option.

See also task 8a in https://es.cs.uni-kl.de/teaching/vrs/exams/2018.08.21.vrs/2018.08.21.vrs.solutions.pdf

by (25.6k points)

Related questions

0 votes
1 answer
asked Aug 23, 2020 in * TF "Emb. Sys. and Rob." by ssripa (550 points)
0 votes
1 answer
asked Aug 20, 2020 in * TF "Emb. Sys. and Rob." by nikita (300 points)
0 votes
1 answer
asked Aug 20, 2020 in * TF "Emb. Sys. and Rob." by maherin (370 points)
0 votes
1 answer
0 votes
1 answer
asked Aug 9, 2021 in * TF "Intelligent Systems" by RS (770 points)
Imprint | Privacy Policy
...