: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
Abstract. We give a process calculus model that formalizes a wellknown algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failur...
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
This paper is part of a focused paper panel discussion addressing the results of an invited workshop conducted in Orlando, Florida in February, 1997. The workshop addressed the qu...
Abstract. This chapter considers the different temporal constructs appeared in the literature of temporal conceptual models (timestamping and evolution constraints), and it provid...