A complete rule for equifair termination
type: Item
instance of: scholarly article
title: A complete rule for equifair termination
zbMATH Open document ID: 0612.68021
DOI: 10.1016/0022-0000(86)90056-5
author: Orna Grumberg
author: Nissim Francez
author: Shmuel Katz
published in: Journal of Computer and System Sciences
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3990848
zbMATH Keywords: equifairness
zbMATH Keywords: nondeterminism
zbMATH Keywords: concurrency
MaRDI profile type: Publication
full work available at URL: 0022-0000(86)90056-5
OpenAlex ID: W2024930796
cites work: Ten years of Hoare's logic: A survey. II: Nondeterminism
cites work: Proof rules and transformations dealing with fairness
cites work: Countable nondeterminism and random assignment
cites work: Fair termination revisited - with delay
cites work: Guarded commands, nondeterminacy and formal derivation of programs
cites work: Programming as a Discipline of Mathematical Nature
cites work: Q3738540
cites work: Q5584402
cites work: Q3347265
cites work: A proof rule for fair termination of guarded commands
cites work: Communicating sequential processes
cites work: Q3922147
description: scientific article; zbMATH DE number 3990848