Condition of an SFC Transition
"Sequential Function Chart"
It can be used to program processes that can be split into steps.
The main components of SFC are:
- Steps with associated actions
- Transitions with associated logic conditions
- Directed links between steps and transitions transitions must have a Boolean condition that indicates
if the transition can be crossed.
The condition is a Boolean expression that can
be programmed in ST "Structured text"
A high-level language that is block structured and syntactically resembles Pascal language.
In ST language, enter a Boolean expression. It can be a complex expression including function calls and parentheses.
Example
bForce AND (bAlarm OR min (iLevel, 1) <> 1)
