§ 1.3
Linear temporal logic
A tiny language for talking about time — the backbone of this lab.
see also · Specification as the test oracle · Runtime verification · Model checking
The grammar
LTL adds temporal operators to ordinary propositional logic. Formulas are evaluated along a run, one state at a time, from the first state onward.
X p— next:pholds in the state that follows.F p— finally:pholds somewhere later (<>).G p— globally:pholds at every step ([]).p U q— until:pholds untilqoccurs, which it eventually does.p W q— weak until: drops the eventual obligation;q R pis its dual.
Two semantics, one grammar
Over an infinite run — the textbook reading — G and F quantify over an endless future. The model checker uses this one.
Over a finite trace — a test case, a log — F p only promises p within what you saw, and X p is false at the last step. That reading is LTLf, the right one for logs and concrete tests.
This lab is bilingual: lab B checks infinite runs, labs A and C check finite traces. Know which language you are speaking before you compare answers.