Fairness assumptions for csp in a temporal logic framework : Preprint
Ruurd Kuiper, W.P. deRoever · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1982
Six fairness assumptions for the repetitive construct *[ ••.□ b,e_ , c,e_ + S,e_ □ ... ] in a subset of CSP are given and classified with respect to the programs they cause to terminate.A total correctness proof system for the subset of CSP is given, incorporating the different fairness assumptions.