Package de.mid.innovator.srv2api.icw2sm
package de.mid.innovator.srv2api.icw2sm
The StateMachine package defines a set of concepts that can be used for
modeling discrete behavior through finite statetransition systems. In addition
to expressing the behavior of a part of the system, state machines can also be
used to express the usage protocol of part of a system.
-
ClassDescriptionDeepHistory represents the most recent active configuration of the composite state that directly contains this pseudostate - the state configuration that was active when the composite state was last exited.DeepHistory represents the most recent active configuration of the composite state that directly contains this pseudostate - the state configuration that was active when the composite state was last exited.An entry point pseudostate is an entry point of a state machine or composite state.An entry point pseudostate is an entry point of a state machine or composite state.An exit point pseudostate is an exit point of a state machine or composite state.An exit point pseudostate is an exit point of a state machine or composite state.An initial pseudostate represents a default vertex that is the source for a single transition to the default state of a composite state.An initial pseudostate represents a default vertex that is the source for a single transition to the default state of a composite state.Joins vertices serve to merge several transitions emanating from source vertices in different orthogonal regions.Joins vertices serve to merge several transitions emanating from source vertices in different orthogonal regions.Junction vertices are semantic-free vertices that are used to chain multiple transitions together.Junction vertices are semantic-free vertices that are used to chain multiple transitions together.Protocol state machines can be redefined into more specific protocol state machines or into behavioral state machines.A protocol state machine is always defined in the context of a classifier.A protocol state machine is always defined in the context of a classifier.A pseudostate is an abstraction that encompasses different types of transient vertices in the state machine graph.A region is an orthogonal part of either a composite state or a state machine.A region is an orthogonal part of either a composite state or a state machine.This is a utility class for SMRegularState that provides static methods for creation or other purposes.shallowHistory represents the most recent active substate of its containing state (but not the substates of that substate).shallowHistory represents the most recent active substate of its containing state (but not the substates of that substate).A state model is a situation which an invariant condition (usually implicit) usually holds in.State machines can be used to express the behavior of part of a system.State machines can be used to express the behavior of part of a system.Entering a terminate pseudostate implies that the execution of this state machine by means of its context object is terminated.Entering a terminate pseudostate implies that the execution of this state machine by means of its context object is terminated.kind=external implies that the transition, if triggered, will exit the composite (source) state.kind=external implies that the transition, if triggered, will exit the composite (source) state.kind=internal implies that the transition, if triggered, occurs without exiting or entering the source state.A transition is a directed relationship between a source vertex and a target vertex.A vertex is an abstraction of a node in a state machine graph.