Precedence rules of temporal operator

Question

What is the precedence rules for temporal operators ?

In the below slide there are precedence rules for propositional logic:

What would be the precedence of temporal operators (Until, Before and When) with respect to the above operators in slide ?

For e.g :

 [(G¬b) ∨ (Gb) B a] -> which one to solve first ? 

 [{(G¬b) ∨ (Gb)} B a] OR [(G¬b) ∨ {(Gb) B a}]

Answer 1

For binary temporal operators, it does not matter since we always use brackets for them. For the unary operators, the precedence is like the negation, i.e. strongest.

Comments

Thanks for the explanation.

Could you please explain how to interpret Q8 (d) 21.08.2018 :  https://es.cs.uni-kl.de/teaching/vrs/exams/2018.08.21.vrs/2018.08.21.vrs.solutions.pdf ?

 [(G¬b) ∨ (Gb) B a] as the bracket is on all.

---

For binary operators like B, you can apply the pattern [* SB * ] to determine the two arguments of the operator. Hence, (G¬b) ∨ (Gb) is the left operator of SB and "a" is the right one.

---

Thanks a lot for this explanation.