|
NOTE: This FSM is just like the one to the left except that this one executes via message passing from STATE to TRANSITION to STATE, etc... following the structure of the graph. Unlike the other example, there is no acquisition process occurring since the message passing (and hence the FSM execution) is "hard-coded".
This is a representation of a finite state machine (FSM) containing two states and four transitions. The transitions are the cones. The white cone represents a transition labeled with "1", and the black cone is a transition labeled with a "0". The states are the cylinders. Cones that point away from a state (rather than to another state) are reflexive transitions.
To provide input to the machine, press the white cube to input a "1" and the black cube to input a "0". When the machine is in State 1, the lamp in the back is turned on. When the machine is in State 2, the lamp is turned off. Thus, the machine defines the behavior of the lamp.