2000 character limit reached
A Formal Model of Anonymous Systems
Published 2 May 2011 in cs.DC | (1105.0296v1)
Abstract: We put forward a formal model of anonymous systems. And we concentrate on the anonymous failure detectors in our model. In particular, we give three examples of anonymous failure detectors and show that they can be used to solve the consensus problem and that they are equivalent to their classic counterparts. Moreover, we show some relationship among them and provide a simple classification of anonymous failure detectors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.