A complete rule for equifair termination

Orna Grumberg; Nissim Francez; Shmuel Katz

doi:10.1016/0022-0000(86)90056-5

A complete rule for equifair termination

Orna Grumberg, Nissim Francez, Shmuel Katz

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	313-332
Number of pages	20
Journal	Journal of Computer and System Sciences
Volume	33
Issue number	3
DOIs	https://doi.org/10.1016/0022-0000(86)90056-5
State	Published - Dec 1986

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
Computer Networks and Communications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1016/0022-0000(86)90056-5

Cite this

@article{cd71e0733899448dbb677094d69a9c79,

title = "A complete rule for equifair termination",

abstract = "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.",

author = "Orna Grumberg and Nissim Francez and Shmuel Katz",

year = "1986",

month = dec,

doi = "10.1016/0022-0000(86)90056-5",

language = "אנגלית",

volume = "33",

pages = "313--332",

number = "3",

}

TY - JOUR

T1 - A complete rule for equifair termination

AU - Grumberg, Orna

AU - Francez, Nissim

AU - Katz, Shmuel

PY - 1986/12

Y1 - 1986/12

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

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

UR - http://www.scopus.com/inward/record.url?scp=0022867326&partnerID=8YFLogxK

U2 - 10.1016/0022-0000(86)90056-5

DO - 10.1016/0022-0000(86)90056-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0022867326

SN - 0022-0000

VL - 33

SP - 313

EP - 332

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 3

ER -

A complete rule for equifair termination

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this