PPT Slide
Message Omissions Problem Description
- n processes connected by a full graph.
- Each process starts with an initial value {0, 1}.
- Synchronous setting - solution is required within r rounds for some fixed r.
- Any number of messages might be lost.