Correctness and concurrent complexity of the black-white bakery algorithm

DOI10.1007/s00165-016-0364-4zbMath1342.68348OpenAlexW2322615457WikidataQ59436837 ScholiaQ59436837MaRDI QIDQ736464

Wim H. Hesselink

Publication date: 4 August 2016

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

Full work available at URL: https://doi.org/10.1007/s00165-016-0364-4

zbMATH Keywords

mutual exclusionUNITYconcurrent complexityFCFS

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (1)

Tournaments for mutual exclusion: verification and concurrent complexity

Uses Software

• PVS
• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verification of sequential and concurrent programs
• Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
• On interprocess communication. I: Basic formalism
• An axiomatic proof technique for parallel programs
• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
• A new solution of Dijkstra's concurrent programming problem
• Long lived adaptive splitter and applications
• Communicating State Transition Systems for Fine-Grained Concurrent Resources
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
• The mutual exclusion problem

This page was built for publication: Correctness and concurrent complexity of the black-white bakery algorithm