Encyclopedia > E > EFSM
EFSM
In a conventional finite state machine, the transition is associated with a set of input Boolean conditions & a set of output Boolean functions. In an Extended Finite State Machine (EFSM) model, the transition can be expressed by an “if statement” consisting of a set if trigger conditions are all satisfied, the transition is fired , bringing the machine from the current state to the next state & performing the specified data operations.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)