Table of Contents

StateMachineStep

Namespace
ZAux

The StateMachine implementation is performance optimized to perform even complicated state transitions (e.g. an already running sequence that needs to be stopped before the state changes) in exactly 1 PLC cycle in which Cyclic is called - This performance-optimization is utilizing this enumeration.

Fields

Begin = 0
Entry = 1

State change is performed if a sequence is mapped to the statemachine's current state

PreActive = 2

If available all listener sequences are executed with ListenerState=PreActive

Active = 3

The actual sequence of the statemachine's current state is exectued. If available all listener sequences are executed in parallel with ListenerState=Active

PostActive = 4

If available all listener sequences are executed with ListenerState=PreActive

Changed = 5
ChangedWithHalt = 6
PreError = 7

If available all listener sequences are executed with ListenerState=PreError

Error = 8

An error occured during execution that can potentially be recovered from

FatalError = 9

Statemachine enters an unrecoverable error, this is usually an implementation mistake of IsTransitionAllowed and/or FinalState

End = 10