A consistent observation of a given distributed computation is a seque
nce of global slates that could be produced by executing that computat
ion on a monoprocessor system. Therefore a distributed execution gener
ally accepts several consistent observations. This paper investigates
global states shared by all such observations. A necessary and suffici
ent condition characterizing these states is first given. Then, an alg
orithm that computes shared global states is described. (C) 1997 Acade
mic Press.