The usual way for debugging a distributed program is to define a set of "observable events" among all events produced by the computation. Those events are sent to an observer process, which must check their correctness. It is well known that these events are only partially ordered by the "happened before" relation. There exists some coding which allows the observer to reconstruct the relation. We define three criteria to evaluate those coding and then propose a new coding which seems to offer a good compromise. The first criteria, called intrusion, measures the amount of additional information induced by the coding. The second criteria, called filtering, defines a set of events which have to be observed to make the coding correct. The third one, called consistency, defines the latency between the reception of an event by the observer and the moment at which it can compute the relation. It is thus a kind of measurement of the "on-line level" of the decoding process. We introduce a new..
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.