Extended finite-state machine

In a conventional finite state machine, the transition is associated with a set of input Boolean conditions and 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 of trigger conditions. If trigger conditions are all satisfied, the transition is fired, bringing the machine from the current state to the next state and performing the specified data operations.
Definition.
An EFSM is defined as a 7-tuple formula_1 where
Structure.
EFSM Architecture: An EFSM model consists of the following three major combinational blocks (and a few registers).
The cycle behavior of an EFSM can be divided into three steps: 
See also.
Abstract state machine
Extended finite state machines