On the mutual-exclusion problem -- a quest for minimal solutions

DOI10.1016/0304-3975(94)90079-5zbMath0811.68085OpenAlexW1986977233MaRDI QIDQ1329738

Uri Abraham, Menachem Magidor

Publication date: 31 July 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90079-5

zbMATH Keywords

critical-section probleminfinite protocol automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Cites Work

• On interprocess communication. I: Basic formalism
• Modeling concurrency with partial orders
• Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
• A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
• Self-stabilizing systems in spite of distributed control
• The mutual exclusion problem

This page was built for publication: On the mutual-exclusion problem -- a quest for minimal solutions