STATE MACHINE

State Machine

State Machine

State Machine Model defines behaviour of particular object, specifying its events that occur throughout its lifetime. Generally, a state machine is any kind of device or instrument that stores the status of something at a particular time and has the ability to operate on input in order to change the cause or status of any output or action to occur for any given change. For example, computer is a kind of state machine. (Brookshear, 2007, 52-98)

Purpose of State Machine Modelling:

A state machine model is a type of diagram which is used in computer sciences and all of its related fields in order to explain and help us understand the behaviours of the systems. Sometimes, in some cases, this model requires the system to comprise of a limited number of states, whereas at other times this model is a rational abstraction. (Lynch, 2003, 300-489)

Applications of State Machine:

State machines models are used to provide an abstract explanation of the systems' behaviour. This behaviour is represented and analysed in a series of actions that can occur in one or more than one possible states. Therefore, every model represents items of a single class and track down different forms of its items throughout the system.

State model can also be in representing graphical illustration of finite state machines. This model was introduced by Taylor booth in 1967 in his book named, Sequential Machine and Automata Theory”. (Hamon, 2005, 164-172)

The state machine is used in the application where apparent state exits. Every single state leads to one or more than one states, and might also finish the process flow.

It is most commonly used while programming user interfaces. While developing a use interface, various actions of the user send the user interface in number of processing segments. Each of these part acts ...