scientific article; zbMATH DE number 1860625
From MaRDI portal
Publication:4790352
Recommendations
- A distributed k-mutual exclusion algorithm using k-coterie
- A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems
- A token based \(k\)-resilient mutual exclusion algorithm for distributed systems
- Automated analysis of mutual exclusion algorithms using CCS
- Analysis of quorum-based protocols for distributed (k+1)-exclusion
- Symmetric and economical solutions to the mutual exclusion problem in a distributed system
Cited in
(7)- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
- Event-based proof of the mutual exclusion property of Peterson's algorithm
- Automated analysis of mutual exclusion algorithms using CCS
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
- Rewriting-based verification of authentication protocols
- On the correctness of Goscinski's algorithm
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 Q4790352)
