Abstract
Chandra et al. [5] showed that the group membership problem cannot be solved in asynchronous systems with crash failures. We identify the main assumptions required for their proof and show how to circumvent this impossibility result building a weaker, yet non trivial specification. We provide an algorithm that solves this specification and show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
