R. Michel, Attaining common knowledge in synchronous distributed networks, unpublished manuscript, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Programming Simultaneous Actions Using Common Knowledge - Moses, Tuttle (1988) (37 citations) (Correct)
....as a result of the difference in the types of failures possible in the two failure models, different facts about the failure pattern are common knowledge at the corresponding points. Ruben Michel has independently characterized the similarity graph in variants of the crash failure model (see [Mi]) For the crash failure model itself, he has an alternative construction that also characterizes the connected components of the similarity graph. 35 As in the omissions model, it follows from Proposition 24 that our construction can be used to derive efficient optimal protocols for ....
R. Michel, Attaining common knowledge in synchronous distributed networks, unpublished manuscript, 1986.
Programming Simultaneous Actions Using Common Knowledge.. - Moses, Tuttle (1988) (37 citations) (Correct)
.... In particular, our construction can be used to derive efficient optimal protocols for simultaneous choice problems in the crash failure model, thus slightly extending [DM] Ruben Michel has independently characterized the similarity graph in the crash failure model and some of its variants (cf. [Mi]) Notice that every processor, faulty or nonfaulty, is able to compute the set V (ae; locally. Consequently, a fact is common knowledge to the nonfaulty processors iff it is common knowledge to all processors. Proposition 16 : In the omissions model, CN j CP . This implies that, in the ....
R. Michel, Attaining common knowledge in synchronous distributed networks, unpublished manuscript, 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC