De nitions. For purposes of these General Terms, the following de nitions apply:
De nitions. The set of players involved in the broadcast protocol is denoted by P . An ad- versary structure A over the player set P is a monotone set of subsets of P , i.e.
De nitions. This Agreement uses the following de xxx terms:
De nitions n De nition 1 Let readyi be the earliest real time value at which any correct processor n sends a hstart, i, n, 1i message, that is when vci 1 = iT . k De nition 2 Let a simultaneous candidate clock be a candidate clock started by al- l correct processors in the system. That is cci;n is a candidate clock if and only if 8k2Pc 9 cci;n. k De nition 3 Let the candidate clock that is chosen by the agreement protocol as the basis for the virtual clock during the next re-synchronization interval be called the elected candidate clock. Let electedi be the earliest real time value at which any correct processor starts the elected candidate clock cci;n k De nition 4 Let endi be the latest real time value at which any correct processor starts the ith virtual clock, cvi . The proof, in general, follows that in [22] closely. So, for brevity, we only present here the steps where main di erences exits. We rst show that the algorithm achieves the precision property.
De nitions. De nition 1 Let readyi be the earliest real time value at which any correct processor herethestepswheremaindi erencesexits.We rstshowthathealgorithmachieves 1 = n n sends a xxxxxx, i, n, k De nition 2 Let a simultaneous candidate clock be a candidate clock started by al- l correct processors in the system. That is cci;n is a candidate clock if and only if theprecisionproperty.
De nitions. The set of players involved in the broadcast protocol is denoted by P . An ad- versary structure A over the player set P is a monotone set of subsets of P , i.e. A 2P with A 2 A =) 8A0 A : A0 2 A: An element A 2 A is called an adversary set. For an adversary structure A, A denotes the basis of A, i.e. the set of all maximal elements of A: The meaning of an adversary structure A is that the players of exactly one ele- ment of A may be corrupted by the adversary.
De nitions
