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:
“Governments which have a regard to the common interest are constituted in accordance with strict principles of justice, and are therefore true forms; but those which regard only the interest of the rulers are all defective and perverted forms, for they are despotic, whereas a state is a community of freemen.”
—Aristotle (384–322 B.C.)
“The machine is impersonal, it takes the pride away from a piece of work, the individual merits and defects that go along with all work that is not done by a machine—which is to say, its little bit of humanity.”
—Friedrich Nietzsche (1844–1900)