Date: 09 Jun 2005

Proof rules dealing with fairness

* Final gross prices may vary according to local VAT.

Get Access


We provide proof rules allowing to deal with two fairness assumptions in the context of Dijkstra's do-od programs. These proof rules are obtained by considering a translated version of the original program which uses random assignment x:=? and admits only fair runs. The proof rules use infinite ordinals and deal with the original programs and not their translated versions.

The full version of this paper is available as Bericht Nr. 8104, Institut für Informatik und Praktische Mathematik, University of Kiel, March 1981, and has been submitted for publication.