Reducing the number of messages in self-stabilizing protocols
From MaRDI portal
Publication:6536331
DOI10.1007/978-3-030-34992-9_12zbMATH Open1543.6804MaRDI QIDQ6536331
Publication date: 19 April 2024
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- The expressive power of snap-stabilization
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST
- Snap-stabilization in message-passing systems
- Termination detection for diffusing computations
- Self-stabilizing extensions for message-passing systems
- The local detection paradigm and its applications to self-stabilization
- Snap-stabilizing PIF on arbitrary connected networks in message passing model
- Proof labeling schemes
- Bounded-wait combining: constructing robust and high-throughput shared objects
- Self-stabilization
- An example of stepwise refinement of distributed programs: quiescence detection
- Distributed Termination
- Self-stabilizing systems in spite of distributed control
- Self-Stabilization by Counter Flushing
- Time optimal self-stabilizing synchronization
- When graph theory helps self-stabilization
Related Items (1)
This page was built for publication: Reducing the number of messages in self-stabilizing protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536331)