Temporal logic (source code)

= Temporal logic
{wiki}

<Temporal logic> extends ordinary <mathematical logic> with assertions about successive states or times. <Temporal operators> express properties such as eventually holding, always holding, or holding until another condition occurs.

In <linear temporal logic>, $G(\mathrm{request}\Rightarrow F\,\mathrm{response})$ says that every request is eventually answered along a trace. A safety property rules out a bad finite behavior; a liveness property requires future progress. <Computation tree logic> additionally distinguishes possible execution paths. The choice of linear or branching time determines exactly which system behaviors a formula quantifies over.