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

524 users

0 votes

Hello,

I have a question regarding the solution for Problem 8(g) of the exam from Feb. 2022 (2022.02.16.vrs.solutions.pdf):

Shouldn't the underlined part be  X( (a -> Ga) & (!a -> G(!a)) )  instead?
The underlined formula in the solution is equivalent to  X( (a -> Ga) & (!a -> !Ga) ), but if I understood it correctly, the latter subformula is not what we want, since we want to express that if a is false at that point in time, it should also always be false in the future (i.e. G(!a)).

Thanks in advance :)

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

1 Answer

0 votes
Yes, I agree with you. We can even write more explicitly the following formula:

    G((!a & X a -> X G a) & (a & X !a -> X G !a))

The above is equivalent to your suggestion.
by (165k points)

Related questions

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