A complete rule for equifair termination

摘要

The notion of equifairness, strengthening the familiar notion of fairness, is introduced as a scheduling policy of nondeterminism and concurrency. Under this notion, it is infinitely often the case that the number of selections of each of a family of infinitely often jointly enabled processes is equal. A proof rule for proving equifair termination is introduced and proved to be semantically complete.