S
- state classI
- input symbol classT
- transition classSP
- state property classTP
- transition property class@ParametersAreNonnullByDefault public interface UniversalTransitionSystem<S,I,T,SP,TP> extends TransitionSystem<S,I,T>
TransitionSystem
interface. For example, neither is whether a state
is initial or not a state property, nor is a transition's successor a
transition property.
A common example are finite state acceptors (FSAs), such as deterministic
finite automata (DFAs). A state can be accepting or non-accepting, thus
the state property would likely be a Boolean
signaling acceptance.
Transitions have are characterized by their successor state only, thus
the transition property would most adequately be realized by the Void
class.
In contrast, in a Mealy Machine do not distinguish between accepting or
rejecting states, but transitions generate output symbols. The state property
would therefore be Void
, but the transition property would be the
output produced by this transition.Modifier and Type | Method and Description |
---|---|
SP |
getStateProperty(S state)
Retrieves the state property for the given state.
|
TP |
getTransitionProperty(T transition)
Retrieves the transition property for the given state.
|
getSuccessor, getSuccessors, getTransitions, powersetView
createDynamicStateMapping, createStaticStateMapping, getInitialStates, getStates, getSuccessors, getSuccessors
Copyright © 2015. All rights reserved.