|HomeShow ChangesEditPrintRecent ChangesSubscriptionsLost and FoundFind ReferencesRename
A finite state machine (FSM) or finite state automaton (plural: automata) is a model of behavior composed of states, transitions and actions. A state stores information about the past, i.e. it reflects the input changes from the system start to the present moment. A transition indicates a state change and is described by a condition that would need to be fulfilled to enable the transition. An action is a description of an activity that is to be performed at a given moment.
See Wikipedia http://en.wikipedia.org/wiki/State_machine
This wiki site is supposed to be a shared resource. As a shared resource everyone is encouraged to add new content or modify existing content!
Enjoy the WF wiki.
Click to read this topic
23-11-2009 15:31:34 - anonymous