 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.