A group membership algorithm with a practical specification

This paper presents a solvable specification and gives an algorithm for the Group Membership Problem in asynchronous systems with crash failures. Our specification requires processes to maintain a consistent history in their sequences of views, This allows processes to order failures and recoveries in time and simplifies the programming of high level applications. Previous work has proven that the Group Membership Problem cannot be solved in asyn chronous systems with crash failures. We circumvent this impossibility resu lt building a weaker, yet nontrivial specification. We show that our soluti on is an improvement upon previous attempts to solve this problem using a w eaker specification. We also relate our solution to other methods and give a classification of progress properties that can be achieved under differen t models.