Starvation-free mutual exclusion with semaphores
From MaRDI portal
Publication:469360
DOI10.1007/S00165-011-0219-YzbMATH Open1298.68192OpenAlexW2035587272MaRDI QIDQ469360FDOQ469360
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
Recommendations
Nonnumerical algorithms (68W05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Forward and backward simulations. I. Untimed Systems
- The existence of refinement mappings
- Title not available (Why is that?)
- Title not available (Why is that?)
- An axiomatic proof technique for parallel programs
- A new solution of Dijkstra's concurrent programming problem
- Splitting forward simulations to cope with liveness
- Monitors
- Verification of sequential and concurrent programs
- Fair mutual exclusion with unfair P and V operations
- A starvation-free solution to the mutual exclusion problem
- Universal extensions to simulate specifications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Starvation-free mutual exclusion with semaphores
- Completeness of ASM refinement
- The structure of the “THE”-multiprogramming system
Cited In (4)
Uses Software
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)