-
Notifications
You must be signed in to change notification settings - Fork 1
Pseudostates
Pseudostate, unlike State, does not represent stable configuration of State Machine. Pseudostates are used to control the flow of Transitions connecting States.
In general, Pseudostate consist of:
- Name, uniquely identifying Pseudostate within State Machine,
- Parent State, if Pseudostate is a child element of Composite State or Orthogonal State,
- Set of outgoing Transitions.
There are four types of Pseudostates:
- Choice that allows to build dynamic Transitions chains, where Transitions are traversed sequentialy and their Guards are evaluated after previous Transition Effect is invoked,
-
Junction that allows to build static Transitions chains, where all Transition Guards are evaluated (and must return
true) before any Transition Effect is invoked, - Fork that allows to enter multiple States (located in different Regions of Orthogonal State) at once,
- Join that allows to leave multiple States (located in different Regions of Orthogonal State) at once.
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