-
Notifications
You must be signed in to change notification settings - Fork 1
Join
Join is a type of Pseudostate used in State Machines to model the synchronization of multiple parallel transitions. It allows the State Machine to wait for all incoming transitions to complete before continuing to a single outgoing transition.
Each Transition incoming to a Join must originate from a State or Pseudostate defined in different orthogonal Regions of an Orthogonal State.
All Transitions incoming to a Join are Default Transitions - they are not explicitly triggered by an Event. Also, no Guards are allowed in Transitions incoming to a Join.
As Join is a Pseudostate and not a State, the State Machine cannot stop its flow on it. Therefore, Join must have exactly one outgoing Transition which must follow the same restrictions as incoming Transitions: no Trigger nor Guard is allowed there.
In UML, a Join pseudostate is represented by a horizontal or vertical bar with multiple incoming transitions and a single outgoing transition:
stateDiagram-v2
state Join <<join>>
[*] --> ParallelStates
state ParallelStates {
[*] --> State1
--
[*] --> State2
--
[*] --> State3
}
State1 --> Join
State2 --> Join
State3 --> Join
Join --> FinalState
Equivalent Stateflows notation of a Join pseudostate:
/* fragment of State Machine definition */
.AddState("State1", b => b
.AddTransition("Join")
)
.AddState("State2", b => b
.AddTransition("Join")
)
.AddState("State3", b => b
.AddTransition("Join")
)
.AddJoin("Join", b => b
.AddTransition("FinalState")
)
.AddState("FinalState")If there is just one Join in the State Machine, a shortened notation with the default name can be used:
/* fragment of State Machine definition */
.AddState("State1", b => b
.AddTransition(Join.Name)
)
.AddState("State2", b => b
.AddTransition(Join.Name)
)
.AddState("State3", b => b
.AddTransition(Join.Name)
)
.AddJoin(b => b // no name provided here, default name is used
.AddTransition("FinalState")
)
.AddState("FinalState")Using lambda style means that the Join pseudostate and its Transitions are defined using string names.
/* fragment of State Machine definition */
.AddState<State1>(b => b
.AddTransition<Join>()
)
.AddState<State2>(b => b
.AddTransition<Join>()
)
.AddState<State3>(b => b
.AddTransition<Join>()
)
.AddJoin(b => b
.AddTransition<FinalState>()
)
.AddState<FinalState>()Using typed style here means that the Join pseudostate is represented by a class, in the example predefined
Joinclass is used.
Join class can be used as a target for typed style Transitions if the State Machine contains just one Join. If there are more Joins, there is an important concern of State identity to be considered.
Home page Support Code licensed under an MIT-style License. Documentation licensed under CC BY 4.0. © by Mikołaj Milewski, 2025
Overview
Installation
Behaviors
State Machines
Building blocks
States
State
Composite State
Orthogonal State
Final State
Pseudostates
Choice
Junction
Fork
Join
Transitions
Transition
Default Transition
Internal Transition
Concepts
Evaluation of Transitions
Activities
Building blocks
Nodes
Action Node
Decision Node
Merge Node
Initial Node
Final Node
Input Node
Output Node
Fork Node
Join Node
Accept Event Action Node
Send Event Action Node
Data Store Node
Structured Activity Node
Iterative Activity Node
Parallel Activity Node
Flows
Data Flow
Control Flow
Concepts
Implicit fork and join
Actions