Bounded fairness

Nachum Dershowitz*, D. N. Jayasimha, Seungjoon Park

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of another event. We formalize bounded fairness by introducing a new family of temporal modal operators. The resultant logic is equivalent to temporal logic with the until modality, but more succinct. This logic can be used to specify bounded fairness requirements in a more natural manner than possible with until. It can, for example, relate the frequency of shared resource access of a particular process to other processes that access the resource with mutual exclusion. As applications of bounded fairness, we verify requirements for some standard concurrent programming problems and for a new cache protocol. We also show that Dekker's mutual exclusion algorithm is fair in the conventional sense, but not bounded fair.

Original languageEnglish
Pages (from-to)304-317
Number of pages14
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2772
StatePublished - 2004

Fingerprint

Dive into the research topics of 'Bounded fairness'. Together they form a unique fingerprint.

Cite this