Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
From MaRDI portal
Publication:1575646
DOI10.1016/S0304-3975(98)00224-2zbMath0944.68195MaRDI QIDQ1575646
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
randomized algorithm; multiparty interaction; strong interaction fairness; weak interaction fairness
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A distributed synchronization scheme for fair multi-process handshakes
- Calculi for synchrony and asynchrony
- Script: A communication abstraction mechanism and its verification
- Appraising fairness in languages for distributed programming
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Some impossibility results in interprocess synchronization
- Real-Time Synchronization of Interprocess Communications
- An Effective Implementation for the Generalized Input-Output Construct of CSP
- Distributed cooperation with action systems
- Communicating sequential processes
- A comprehensive study of the complexity of multiparty interaction