- 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:
“It is almost never when a state of things is the most detestable that it is smashed, but when, beginning to improve, it permits men to breathe, to reflect, to communicate their thoughts with each other, and to gauge by what they already have the extent of their rights and their grievances. The weight, although less heavy, seems then all the more unbearable.”
—Alexis de Tocqueville (1805–1859)
“In this sad state, God Tender Bowells run
Out streams of Grace: And he to end all strife
The Purest Wheate in Heaven, his deare-dear Son
Grinds, and kneads up into this Bread of Life.
Which Bread of Life from Heaven down came and stands
Disht on thy Table up by Angells Hands.”
—Edward Taylor (1645–1729)