A complete rule for equifair termination (Q1088401)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A complete rule for equifair termination |
scientific article; zbMATH DE number 3990848
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete rule for equifair termination |
scientific article; zbMATH DE number 3990848 |
Statements
A complete rule for equifair termination (English)
0 references
1986
0 references
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.
0 references
equifairness
0 references
nondeterminism
0 references
concurrency
0 references
