A fairness assumption selects admissible infinite paths in a transition system, often to exclude executions that postpone an enabled activity forever. The notation 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, means that holds infinitely often, while means that holds permanently after some finite point. Therefore implies : once every position satisfies , every later suffix contains such a position. The converse fails on an alternating path in a transition system where 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.

Articles by others on the same topic (0)

There are currently no matching articles.