The set agreement problem states that from n proposed values at most n− 1 can be decided.
Traditionally, this problem is solved using a failure detector in asynchronous systems where
processes may crash but not recover, where processes have different identities, and where
all processes initially know the membership. In this paper we study the set agreement
problem and the weakest failure detector L used to solve it in asynchronous message
passing systems where processes may crash and recover, with homonyms (ie, processes …