In this paper, we are proposing the new protocol Ramos聽which implements a fault-tolerant, and a context consistency (ensuring a total order of write operations) based on an asynchronous message-passing model. Communication takes place via gossip messages, which are sent at any frequency between a dynamic set of nodes. Ramos聽is based on the Rambo III聽algorithm for replicated data services. Rambo III聽provides two functions: reconfiguration of a dynamic set of nodes and reading/writing of a replicated object. In Ramos聽the reconfiguration process from Rambo III聽is adapted to the needs of collaborative systems and Paxos聽is used to execute concurrent write operations. It is assumed that from a total set of nodes, at most a subset of nodes is allowed to fail simultaneously. Furthermore, it is assumed that the application using Ramos聽provides a leader-election method. Ramos, the algorithm proposed here, provides one significant feature: all write operations are totally ordered.