scientific article; zbMATH DE number 868108
From MaRDI portal
Publication:4873992
Recommendations
Cited in
(8)- Logical classification of distributed algorithms (Bakery algorithms as an example)
- Correctness and concurrent complexity of the black-white bakery algorithm
- Towards an automatic proof of the bakery algorithm
- Proving properties of the Chord protocol using the ASM formalism
- Mutual exclusion as a matter of priority
- Self-stabilizing timestamps
- Under the hood of the bakery algorithm: mutual exclusion as a matter of priority
- Moded and continuous abstract state machines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4873992)