A State Machine defines a set of concepts that can be used for modeling discrete behavior through finite state-transition systems.

In addition to the common attributes.

A textual property that gives an overview of the dictionary item.

Access is read/write.

In addition to the common associations.

Relationship to Comments that are applied to the State Machine.

Multiplicity is 0+, access is read/write.

Relationship to Constraints that are applied to the State Machine.

Multiplicity is 0+, access is read/write.

Relationship to Comments that are owned by the State Machine.

Multiplicity is 0+, access is read/write.

Relationship to Constraints that are owned by the State Machine.

Multiplicity is 0+, access is read/write.

Relationship to States (Atomic States, Concurrent States, Entry States, Exit States, Final States, Fork States, History States, Initial States, Join States, Junction States, Sequential States or Submachine States) that are owned directly by the State Machine.

Multiplicity is 0+, access is read/write.

See also State.

Relationship to the item that owns the State Machine.

Multiplicity is 1, access is read/write.

Relationship to State Diagrams that are owned by the State Machine.

Multiplicity is 0+, access is read/write.

Relationship to States (Atomic States, Concurrent States, Entry States, Exit States, Final States, Fork States, History States, Initial States, Join States, Junction States, Sequential States or Submachine States) that are owned directly or indirectly by the State Machine.

Multiplicity is 0+, access is read-only.

See also Owned State.