composite State

kind = local ... However, for local Transitions the target Vertex must be different from its source Vertex. A local Transition can only exist within a composite State.

Source

Unified Modeling Language 2.5.1

If the Transition explicitly enters one or more Regions (in case of a fork), these Regions are entered explicitly and the others by default.

Source

Unified Modeling Language 2.5.1

If the Transition terminates on the edge of the composite State (i.e., without entering the State), then all the Regions are entered using the default entry rule above.

Source

Unified Modeling Language 2.5.1

If the composite State is also an orthogonal State with multiple Regions, each of its Regions is also entered, either by default or explicitly.

Source

Unified Modeling Language 2.5.1

If the exit occurs through an exitPoint Pseudostate, then the exit Behavior of the State is executed after the effect Behavior of the Transition terminating on the exit point.

Source

Unified Modeling Language 2.5.1

When exiting from a composite State, exit commences with the innermost State in the active state configuration. This means that exit Behaviors are executed in sequence starting with the innermost active State.

Source

Unified Modeling Language 2.5.1

Composite state entry and exit points

Gallery

Tutorial

TRAIL: Webel's ultimate guide to Systems Modeling Language (v1) with MagicDraw/Cameo

Section

01:03: UML Behavior: StateMachines quick start

Slide kind

UML StateMachine Diagram

A State is said to be active if it is part of the active state configuration.

Source

Unified Modeling Language 2.5.1

StateMachine execution is represented by transitions from one active state configuration to another in response to Event occurrences that match the Triggers of the StateMachine.

Source

Unified Modeling Language 2.5.1

An executing StateMachine instance can only be in exactly one state configuration at a time, which is referred to as its active state configuration.

Source

Unified Modeling Language 2.5.1

For example, one valid state configuration for an execution of the StateMachine depicted in Figure 14.9 is: <CourseAttempt - Studying – (Studying::Lab2, Studying::TermProject, Studying::FinalTest)>.

Source

Unified Modeling Language 2.5.1

Similarly, we can talk about such a hierarchy of substates within a composite State. This complex hierarchy of States is referred to as a state configuration (of a State or a StateMachine).

Source

Unified Modeling Language 2.5.1

Consequently, a particular “state” of an executing StateMachine instance is represented by one or more hierarchies of States, starting with the topmost Regions of the StateMachine and down through the composition hierarchy to the simple, or leaf, States.

Source

Unified Modeling Language 2.5.1

In general, a StateMachine can have multiple Regions, each of which may contain States of its own, some of which may be composites with their own multiple Regions, etc.

Source

Unified Modeling Language 2.5.1

State configurations

Gallery

Tutorial

TRAIL: Webel's ultimate guide to Systems Modeling Language (v1) with MagicDraw/Cameo

Section

01:03: UML Behavior: StateMachines quick start

Slide kind

UML StateMachine Diagram

Kinds of States

Gallery

Tutorial

TRAIL: Webel's ultimate guide to Systems Modeling Language (v1) with MagicDraw/Cameo

Section

01:03: UML Behavior: StateMachines quick start

Slide kind

UML StateMachine Diagram

uml101 - StateMachines - NOTATION REFERENCE CARD

Gallery

Tutorial

TRAIL: Webel's ultimate guide to Systems Modeling Language (v1) with MagicDraw/Cameo

Section

01:03: UML Behavior: StateMachines quick start

Slide kind

UML StateMachine Diagram

A StateMachine or composite State may contain multiple Regions representing behaviors that may occur in parallel.

Source

Unified Modeling Language 2.5.1

A Region is a top-level part of a StateMachine or a composite State, that serves as a container for the Vertices and Transitions of the StateMachine.

Source

Unified Modeling Language 2.5.1

external - Implies that the Transition, if triggered, will exit the composite (source) State.

Source

Unified Modeling Language 2.5.1

local - Implies that the Transition, if triggered, will not exit the composite (source) State, but it will exit and re-enter any state within the composite State that is in the current state configuration.

Source

Unified Modeling Language 2.5.1

Screencast: Tutorial: UML/SysML: StateMachines vs Activities: Operation-driven Transition case study - UML-2.5.1 'Figure 14.7 Composite State with two States' in Cameo Simulation Toolkit

Keywords

Video style

This video accompanies this detailed tutorial trail: HOWTO simulate UML-2.5.1 'Figure 14.7 Composite State with two States' in Cameo Simulation Toolkit - Operation-driven Transition case study.

This full length tutorial is a case study of the telephone dialer StateMachine shown in 'Figure 14.7 Composite State with two States' of the UML-2.5.1 specification.

Read more about Screencast: Tutorial: UML/SysML: StateMachines vs Activities: Operation-driven Transition case study - UML-2.5.1 'Figure 14.7 Composite State with two States' in Cameo Simulation Toolkit

Figure 14.7 Composite State with two States

Gallery

Tutorial

HOWTO simulate UML-2.5.1 'Figure 14.7 Composite State with two States' in Cameo Simulation Toolkit - Operation-driven Transition case study

Section

Slide kind

UML StateMachine Diagram

shallowHistory Pseudostate can only be defined for composite States and, at most one such Pseudostate can be included in a Region of a composite State.

Source

Unified Modeling Language 2.5.1

shallowHistory – ... A single outgoing Transition from this Pseudostate may be defined terminating on a substate of the composite State. This substate is the default shallow history state of the composite State.

Source

Unified Modeling Language 2.5.1

A deepHistory Pseudostate can only be defined for composite States and, at most one such Pseudostate can be contained in a Region of a composite State.

Source

Unified Modeling Language 2.5.1

exitPoint – ... If multiple Transitions from orthogonal Regions within the State terminate on this Pseudostate, then it acts like a join Pseudostate.

Source

Unified Modeling Language 2.5.1

Transitions terminating on an exit point within any Region of the composite State or a StateMachine referenced by a submachine State implies exiting of this composite State or submachine State (with execution of its associated exit Behavior).

Source

Unified Modeling Language 2.5.1

exitPoint – An exitPoint Pseudostate is an exit point of a StateMachine or composite State that provides encapsulation of the insides of the State or StateMachine.

Source

Unified Modeling Language 2.5.1

In each Region of the StateMachine or composite State owning the entryPoint, there is at most a single Transition from the entry point to a Vertex within that Region.

Source

Unified Modeling Language 2.5.1

entryPoint – An entryPoint Pseudostate represents an entry point for a StateMachine or a composite State that provides encapsulation of the insides of the State or StateMachine.

Source

Unified Modeling Language 2.5.1

fork – fork Pseudostates serve to split an incoming Transition into two or more Transitions terminating on Vertices in orthogonal Regions of a composite State.

Source

Unified Modeling Language 2.5.1

Exiting via a FinalState or by a group Transition has the same meaning as for ordinary composite States.

Source

Unified Modeling Language 2.5.1

An entry point is equivalent to a junction Pseudostate (fork in cases where the composite State is orthogonal): Entering via an entry point implies that the entry Behavior of the composite state is executed, followed by the Transition from the entry ...

Source

Unified Modeling Language 2.5.1

A submachine StateMachine can be entered via its default (initial) Pseudostate or via any of its entry points (i.e., it may imply entering a non-orthogonal or an orthogonal composite State with Regions). Entering via the initial Pseudostate ...

Source

Unified Modeling Language 2.5.1

The Regions of the submachine StateMachine are the Regions of the composite State.

Source

Unified Modeling Language 2.5.1

A submachine State implies a macro-like insertion of the specification of the corresponding submachine StateMachine. It is, therefore, semantically equivalent to a composite State.

Source

Unified Modeling Language 2.5.1

However, whereas encapsulated composite States and their internals are contained within the StateMachine in which they are defined, submachines are, like programming language macros, distinct Behavior specification ...

Source

Unified Modeling Language 2.5.1

Subscribe to composite State