A queue based mutual exclusion algorithm

DOI10.1007/S00236-008-0086-ZzbMath1172.68041OpenAlexW2045395233MaRDI QIDQ1006897

Wim H. Hesselink, Alex A. Aravind

Publication date: 26 March 2009

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/2673455/2009ActaInfAravind.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Queue based mutual exclusion with linearly bounded overtaking ⋮ Simulation refinement for concurrency verification ⋮ Nonatomic dual bakery algorithm with bounded tokens

Uses Software

• SPIN
• PVS
• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A criterion for atomicity revisited
• A more efficient generalization of Peterson's mutual exclusion algorithm
• A mutual exclusion algorithm with optimally bounded bypasses
• On interprocess communication. I: Basic formalism
• Myths about the mutual exclusion problem
• An assertional proof for a construction of an atomic variable
• A new solution of Dijkstra's concurrent programming problem

This page was built for publication: A queue based mutual exclusion algorithm