The effect is the same as if the Transition terminating on the deepHistory Pseudostate had, instead, terminated on the innermost State of the preserved state configuration, including execution of all entry Behaviors encountered along the way. Source Unified Modeling Language 2.5.1
Deep history (deepHistory) represents the full state configuration of the most recent visit to the containing Region. 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
Transition::container : Region [1..1] ... Designates the Region that owns this Transition. Source Unified Modeling Language 2.5.1
When exiting from an orthogonal State, each of its Regions is exited. After that, the exit Behavior of the State is executed. Source Unified Modeling Language 2.5.1
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
14.5.2 FinalState ... If the enclosing Region is directly contained in a StateMachine and all other Regions in that StateMachine also are completed, then it means that the entire StateMachine behavior is completed. Source Unified Modeling Language 2.5.1
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
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 – ... this type of Pseudostate is a kind of variable that represents the most recent active substate of its containing Region, but not the substates of that substate. A Transition terminating on this Pseudostate implies rest 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
deepHistory – This type of Pseudostate is a kind of variable that represents the most recent active state configuration of its owning Region. ... a Transition terminating on this Pseudostate implies restoring the Region to that same 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
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
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
join – This type of Pseudostate serves as a common target Vertex for two or more Transitions originating from Vertices in different orthogonal Regions. Source Unified Modeling Language 2.5.1
initial - An initial Pseudostate represents a starting point for a Region; that is, it is the point from which execution of its contained behavior commences when the Region is entered via default activation. Source Unified Modeling Language 2.5.1
14.2.3.6 FinalState: FinalState is a special kind of State signifying that the enclosing Region has completed. Thus, a Transition to a FinalState represents the completion of the behaviors of the Region containing the FinalState. Source Unified Modeling Language 2.5.1
When a Region of the submachine StateMachine reaches the corresponding exit point, the submachine state is exited via this exit point. Source Unified Modeling Language 2.5.1
An entry point connection point reference as the target of a Transition implies that the target of the Transition is the entryPoint Pseudostate as defined in the submachine of the submachine State. As a result, the Regions of the submachine ... 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
