The algorithm has three phases: Initiation, Propagation and Termination and works as follows
if the graph is strongly connected and at least one process spontaneously records its state, then all processes will record their states in finite time (provided L1 is ensured).
The global state recorded by the algorithm may not correspond exactly to any state the system was in at a given point in time, but it does provide a logically consistent snapshot of a state that is guaranteed to be reachable from the initial system state, and from which the final (terminal) system state is reachable.