Abstract   A proof method for establishing the fair termination and total correctness of both nondeterministic and concurrent programs is presented. The method calls for the extension of state by auxiliary delay variables which count down to the instant in which certain action will be scheduled. It then uses well-founded ranking to prove fair termination allowing nested fair selection and loops.
['Krzysztof R. Apt', 'Amir Pnueli', 'Jonathan Stavi']
Fair termination revisited-with delay