Peterson's mutual exclusion algorithm revisited
From MaRDI portal
Publication:1370158
DOI10.1016/S0167-6423(97)00003-8zbMATH Open0881.68036OpenAlexW2018259155MaRDI QIDQ1370158FDOQ1370158
Authors: F. W. van der Sommen, W. H. J. Feijen, A. J. M. van Gasteren
Publication date: 26 October 1997
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6423(97)00003-8
Recommendations
Cited In (8)
- Event-based proof of the mutual exclusion property of Peterson's algorithm
- A mutual exclusion algorithm with optimally bounded bypasses
- The mutual exclusion problem: part II---Statement and solutions
- ZB 2005: Formal Specification and Development in Z and B
- Assertional and behavioral approaches to concurrency
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Title not available (Why is that?)
- The mutual exclusion problem
This page was built for publication: Peterson's mutual exclusion algorithm revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370158)