State Machine Replication

State Machine Replication

For the subsequent discussion a State Machine will be defined as the following tuple of values (See also Mealy machine and Moore Machine):

  • A set of States
  • A set of Inputs
  • A set of Outputs
  • A transition function (Input x State -> State)
  • An output function (Input x State -> Output)
  • A distinguished State called Start.

A State Machine begins at the State labeled Start. Each Input received is passed through the transition and output function to produce a new State and an Output. The State is held stable until a new Input is received, while the Output is communicated to the appropriate receiver.

It should be clear that any algorithm can be implemented using this model if driven by an appropriate Input stream. In particular, this discussion requires a State Machine to have the following property:

Deterministic:
Multiple copies of the same State Machine begun in the Start state, and receiving the same Inputs in the same order will arrive at the same State having generated the same Outputs.

Read more about State Machine Replication:  The State Machine Approach, Historical Background

Famous quotes containing the words state and/or machine:

    Wisdom has lost repute because it so often applies to a state of affairs that no longer exists.
    Mason Cooley (b. 1927)

    The Frenchman Jean-Paul ... Sartre I remember now was his last name had a dialectical mind good as a machine for cybernetics, immense in its way, he could peel a nuance like an onion, but he had no sense of evil, the anguish of God, and the possible existence of Satan.
    Norman Mailer (b. 1923)