ABSTRACT
Consider a distributed system consisting of n processes 0, 1, 2, …, n − 1. Let si denote the local state of process i. e global state (also called the configuration) S of the distributed system consists of the local states of all the processes and is dened as S = s0 × s1 × s2 × ⋯ × sn−1. While this is adequate for systems that use shared memory for interprocess communication, for message-passing models, the global state also includes the states of the channels. e global state of a distributed system is also called its configuration.
