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

868 questions

986 answers


438 users

0 votes

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

1 Answer

0 votes
That is not true, you can easily check that the following formula is valid using the LTL prover:

G(!a&!b) -> !(FG(a&!b) nor G(a&!b)  & G!b) & !F G(a&!b)

Hence, both formulas are false. It is clear that G!b holds, but neither FG(a&!b) nor G(a&!b) would hold, since a does not hold always (as you wrote). But FG(a&!b) is not equivalent to G(a&!b). Moreover, F[a WU b] is equivalent to F (b | G a) which is also not true.
by (139k points)
Imprint | Privacy Policy