No label defined (Q3347265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3890705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3890705 |
Statements
1984
0 references
proof rule
0 references
logics and meanings of programs
0 references
ordinals
0 references
invariant
0 references
equifairness
0 references
non-determinism
0 references
concurrency
0 references
strong equifair-termination
0 references
0.9660161137580872
0 references
0.8344219923019409
0 references
0.7926971912384033
0 references
[For the entire collection see Zbl 0533.00026.] The notion of equifairness, strengthening the familiar notion of fairness, is introduced as a scheduling policy of non-determinism 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 strong equifair- termination is introduced, applied to examples and shown to be (semantically) complete.
0 references