State

A state is a condition during the life of an object which it may either satisfy some condition for performing some activities, or waiting for some events to be received.

A state has five parts:

1. State Name – Name of State
2. Entry – Action performed on entry to state
3. Do Activity – Action performed on entry to state
4. Exit State – Action performed on leaving state
5. Deferrable Trigger – A list of events that are not handled in that state but, rather, are postponed and queued for handling by the object in another state

An object remains in a state for a finite amount of time. For example, a Heater in a home might be in any of four states: Idle, Cooling, Heating, Initiating and Active.

Transition

1. A transition is a relationship between two states indicating that an object in the first state will perform certain actions and enter the second state when a specified event occurs and specified conditions are satisfied.
2. Transition fires means change of state occurs. Until transition fires, the object is in the source state; after it fires, it is said to be in the target state.
3. A transition has five parts:
   1. Source state – The state affected by the transition
   2. Event trigger – a stimulus that can trigger a source state to fire on satisfying guard condition,
   3. Guard condition – Boolean expression that is evaluated when the transition is triggered by the reception of the event trigger,
   4. Action – An executable atomic computation that may directly act on the object that owns the state machine, and indirectly on other objects that are visible to the object,
   5. Target state – The state that is active after the completion of the transition.

Decision Node

A Decision ode is used to represent a test condition to ensure that the control flow or object flow only goes down one path.

Fork node is a pseudo state used to split an incoming transition into two or more transitions terminating on orthogonal target vertices. The segments outgoing from a fork vertex must not have guards or triggers and it must have exactly one incoming and at least two outgoing transitions.

Join node is a pseudo state used to merge several transitions emanating from source vertices in different orthogonal regions. The transitions entering a join vertex cannot have guards or triggers and it must have at least two incoming transitions and exactly one outgoing transition.

Merge node is used to bring back together different decision paths that ware created using a decision node.

Choice is a pseudo state which, when reached, result in the dynamic evaluation of the guards of the triggers of its outgoing transitions. This realizes a dynamic conditional branch. It allows splitting of transitions into multiple outgoing paths such that the decision on which path to take.

Example: Choice Node for State Machine Diagram

Terminate is a pseudo state indicates that the lifeline of the state machine has ended. A terminate pseudo-state is represented by a cross.

Unlike a final state, a terminate pseudo state implies that the state machine is ended due to the context object is terminated. There is no exit of any states nor does the state machine perform any exit actions other than the actions associated with the transition that leads to the terminate state.

Composite State

A simple state is one which has no substructure. Composite States can be further broken down into substates (either within the state or in a separate diagram). A state which has substates (nested states) is called a composite state.

1. Substates may be nested to any level.
2. A nested state machine may have at most one initial state and one final state.
3. Substates are used to simplify complex flat state machines by showing that some states are only possible within a particular context (the enclosing state).

Composite State vs Submachine State

Besides composite state, there is another symbol called submachine state, which is semantically equivalent to a composite state.

Orthogonal State

A composite state with two or more regions is called orthogonal. Unlike composite states, submachine states are intended to group states, so you can reuse them. Orthogonal state is divided into two or more regions separated by a dashed line:

1. One state of each region is always active at any point in time, i.e., concurrent substrates
2. Entry: transition to the boundary of the orthogonal state activates the initial states of all regions
3. Exit: final state must be reached in all regions to trigger completion event

Note That:

You can use parallel and synchronized node to ordinate different substates. Concurrent Substates are independent and can complete at different time.

History State – Shallow / Deep

History states allow the state machine to re­enter the last substate that was active prior to leaving the composite state. An example of history state usage is presented in the figure below: