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

532 users

0 votes
Hello,

While learning for the exam I've found the following two relations in the script:

FGa = GFa
GXa = XGa

And I've wondered if also the combination of all other operators are commutative especially if the following is true: FXa = XFa

Thanks in advance
in * TF "Emb. Sys. and Rob." by (150 points)
I think you missed an X in the first equation, right? If so, please add it. If not, where did you see this equation? It is apparently wrong and needs to be corrected.

1 Answer

+1 vote

Not all of the above are true, so I am wondering where you found them. The X operators commutes with all other future operators, so we have

    G X p = X G p
    F X p = X F p
    [(X p) SU (X q) = X[p SU q]
    [(X p) WU (X q) = X[p WU q]
    [(X p) SB (X q) = X[p SB q]
    [(X p) WB (X q) = X[p WB q]

However, F G p is not equivalent to G F p. The former states that p holds always after some point of time, the latter says that it holds infinitely often. The two are not equivalent. You can check equivalences like these using the LTL tool; simply try (F G p) <-> (G F p) and you will see a counterexample.

by (166k points)

Related questions

0 votes
1 answer
0 votes
1 answer
asked Aug 16, 2021 in * TF "Emb. Sys. and Rob." by KB (280 points)
0 votes
1 answer
Imprint | Privacy Policy
...