scientific article; zbMATH DE number 3890705

From MaRDI portal
Publication:3347265





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347265)