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[1] as a 7-tuple M=(I,O,S,D,F,U,T) 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:

  1. In E-block, evaluate all trigger conditions.
  2. In FSM-block, compute the next state & the signals controlling A-block.
  3. In A-block, perform the necessary data operations and data movements.

See also

Abstract state machine Extended finite state machines

References

  1. Cheng, K-T; Krishnakumar, A.S. (1993). "Automatic Functional Test Generation Using The Extended Finite State Machine Model". International Design Automation Conference (DAC). ACM. pp. 86–91.
This article is issued from Wikipedia - version of the Tuesday, March 22, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.