2026-07-24T00:01:47Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9541 2024-03-06T10:44:40Z ddc:004 open_access

Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk) van Glabbeek, Rob Mutual exclusion speed independence concurrent reading and writing liveness justness A mutual exclusion algorithm is called speed independent if its correctness does not depend on the relative speed of the components. Famous mutual exclusion protocols such as Dekker's, Peterson's and Lamport's bakery are meant to be speed independent. In this talk I argue that speed-independent mutual exclusion may not be implementable on standard hardware, depending on how we believe reading and writing to a memory location is really carried out. It can be implemented on electrical circuits, however. This builds on previous work showing that mutual exclusion cannot be accurately modelled in standard process algebras. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Rob van Glabbeek 2018 Is Part Of LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2018.3 urn:nbn:de:0030-drops-95415 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.3 eng https://creativecommons.org/licenses/by/3.0/legalcode