- 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:
“The State never intentionally confronts a man’s sense, intellectual or moral, but only his body, his senses. It is not armed with superior wit or honesty, but with superior physical strength.”
—Henry David Thoreau (1817–1862)
“When he was at the table with them, he took bread, blessed and broke it, and gave it to them. Then their eyes were opened, and they recognized him; and he vanished from their sight.”
—Bible: New Testament, Luke 24:30,31.
The Emmaus story.