Starvation-free mutual exclusion with semaphores

DOI10.1007/S00165-011-0219-YMaRDI QIDQ469360zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink, Mark IJbema

Publication date 10 November 2014

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-011-0219-y

zbMATH Keywords

refinementmutual exclusionbinary semaphoresemaphorestarvation freedom

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Comments on Morris's starvation-free solution to the mutual exclusion problem
• A queue based mutual exclusion algorithm
• scientific article; zbMATH DE number 5019549
• THE CONTROL OF STARVATION
• The mutual exclusion problem: part II---Statement and solutions

Cites work

• scientific article; zbMATH DE number 986405 (Why is no real title available?)
• scientific article; zbMATH DE number 3943003 (Why is no real title available?)
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 3735115 (Why is no real title available?)
• scientific article; zbMATH DE number 52160 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• A new solution of Dijkstra's concurrent programming problem
• A starvation-free solution to the mutual exclusion problem
• An axiomatic proof technique for parallel programs
• Completeness of ASM refinement
• Fair mutual exclusion with unfair P and V operations
• Forward and backward simulations. I. Untimed Systems
• Monitors
• Splitting forward simulations to cope with liveness
• Starvation-free mutual exclusion with semaphores
• The existence of refinement mappings
• The structure of the “THE”-multiprogramming system
• Universal extensions to simulate specifications
• Verification of sequential and concurrent programs

Cited in

(4)

• Comments on Morris's starvation-free solution to the mutual exclusion problem
• Starvation-free mutual exclusion with semaphores
• An optimal self-stabilizing strarvation-free alternator
• THE CONTROL OF STARVATION

Describes a project that uses

Uses Software

• UNITY

This page was built for publication: Starvation-free mutual exclusion with semaphores

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