- main page: state transition table.
A state table defines all details of the behaviour of a state of a VFSM. It consists of three columns: in the first column state names are used, in the second the virtual conditions built out of input names using the positive logic algebra are placed and in the third column the output names appear:
| State Name | Condition(s) | Actions(s) |
|---|---|---|
| Current state | Entry action | Output name(s) |
| Exit action | Output name(s) | |
| Virtual condition | Output name(s) | |
| ... | ... | |
| Next state name | Virtual condition | Output name(s) |
| Next state name | Virtual condition | Output name(s) |
| ... | ... | ... |
Read the table as following: the first two lines define the entry and exit actions of the current state. The following lines which do not provide the next state represent the input actions. Finally the lines providing the next state represent the state transition conditions and transition actions. All fields are optional. A pure combinatorial VFSM is possible in case only where input actions are used, but no state transitions are defined. The transition action can be replaced by the proper use of other actions.
Read more about this topic: Virtual Finite-state Machine
Famous quotes containing the words state and/or table:
“People think they have taken quite an extraordinarily bold step forward when they have rid themselves of belief in hereditary monarchy and swear by the democratic republic. In reality, however, the state is nothing but a machine for the oppression of one class by another, and indeed in the democratic republic no less than in the monarchy.”
—Friedrich Engels (1820–1895)
“A man who can dominate a London dinner table can dominate the world. The future belongs to the dandy. It is the exquisites who are going to rule.”
—Oscar Wilde (1854–1900)