OTX Reference
|
|
State machine as an alternative to a sequence More...
Namespaces | |
namespace | DataTypes |
Data types, see also Core data types. | |
Classes | |
class | CheckerRule |
Comprehensive checker rule listing, see also Core checker rules. More... | |
class | StateMachineProcedure |
A StateMachineProcedure replaces the ProcedureRealisation by the StateMachineProcedureRealisation.A StateMachineProcedure shall not have a ProcedureRealisation. More... | |
State machine as an alternative to a sequence
A finite-state machine (FSM) or simply a state machine, is conceived as an abstract machine that can be in one of a finite number of states.The machine is in only one state at a time; the state it is in at any given time is called the current state.It can change from one state to another when initiated by a triggering event or condition; this is called a transition.A particular FSM is defined by a list of its states, and the triggering condition for each transition.