Closed schedulers: a novel technique for analyzing asynchronous protocols
- 1 June 1995
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 8 (4) , 203-210
- https://doi.org/10.1007/bf02242738
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous SystemsInformation and Computation, 1993
- The asynchronous computability theorem for t-resilient tasksPublished by Association for Computing Machinery (ACM) ,1993
- Generalized FLP impossibility result for t-resilient asynchronous computationsPublished by Association for Computing Machinery (ACM) ,1993
- A combinatorial characterization of the distributed 1-solvable tasksJournal of Algorithms, 1990
- Renaming in an asynchronous environmentJournal of the ACM, 1990
- Impossibility results in the presence of multiple faulty processesPublished by Springer Nature ,1989
- Extended impossibility results for asynchronous complete networksInformation Processing Letters, 1987
- Asynchronous approximate agreementPublished by Association for Computing Machinery (ACM) ,1987
- Fault-tolerant decision making in totally asynchronous distributed systemsPublished by Association for Computing Machinery (ACM) ,1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985