For any temporal formula F, the temporal formula <>F asserts that F is eventually true.



More precisely, <>F is true for a behavior

 
  s , s , s , ... 
   1   2   3
if and only if F is true for the behavior
  s , s   , s   , ...
   N   N+1   N+2
for some N > 0. Equivalently,
  <>F  ==  ~ [] ~ F



The symbol <> also appears as an indivisible part of the operator

  <><A>
       v
where A is an action and v is a state function. This formula is true of a behavior iff some step of the behavior is a
  <A>
     v
step. Equivalently,
  <><A>  ==  ~ [] [~A]
       v              v