= Fairness assumption
A <fairness assumption> selects admissible infinite <paths in a transition system>, often to exclude executions that postpone an enabled activity forever. The notation $TS\models_{\mathrm{fair}}\varphi$ quantifies only over initial <paths in a transition system> satisfying the chosen condition; without that qualification, an unfair execution can invalidate a progress claim.
In <linear temporal logic>, $GFp$ means that $p$ holds infinitely often, while $FGp$ means that $p$ holds permanently after some finite point. Therefore $FGp$ implies $GFp$: once every position satisfies $p$, every later <suffix> contains such a position. The converse fails on an alternating <path in a transition system> where $p$ is true at exactly the even positions. This distinction matters when specifying repeated service versus eventual permanent availability.
A <fairness assumption> must be justified by the environment or scheduling model; it does not itself supply an implementation that enforces the assumed progress.
Back to article page