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 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
Any guards associated with these entry point Transitions must evaluate to true in order for the specification to be well formed. 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