Package net.automatalib.ts

Interface UniversalTransitionSystem<S,I,T,SP,TP>

Type Parameters:

S - state class

I - input symbol class

T - transition class

SP - state property class

TP - transition property class

All Superinterfaces:

SimpleTS<S,I>, TransitionSystem<S,I,T>

All Known Subinterfaces:

AcceptorTS<S,I>, DeterministicAcceptorTS<S,I>, DFA<S,I>, FiniteStateAcceptor<S,I>, Lasso.DFALasso<I>, Lasso.MealyLasso<I,O>, MealyMachine<S,I,T,O>, MealyTransitionSystem<S,I,T,O>, ModalTransitionSystem<S,I,T,TP>, MooreMachine<S,I,T,O>, MooreTransitionSystem<S,I,T,O>, MutableAutomaton<S,I,T,SP,TP>, MutableDeterministic<S,I,T,SP,TP>, MutableDFA<S,I>, MutableFSA<S,I>, MutableMealyMachine<S,I,T,O>, MutableModalTransitionSystem<S,I,T,TP>, MutableMooreMachine<S,I,T,O>, MutableNFA<S,I>, MutableProbabilisticMealy<S,I,T,O>, MutableSubsequentialTransducer<S,I,T,O>, NFA<S,I>, OneSEVPA<L,I>, ProbabilisticMealyMachine<S,I,T,O>, SBA<S,I>, SEVPA<L,I>, ShrinkableAutomaton<S,I,T,SP,TP>, ShrinkableDeterministic<S,I,T,SP,TP>, SPA<S,I>, SPMM<S,I,T,O>, StateLocalInputMealyMachine<S,I,T,O>, SubsequentialTransducer<S,I,T,O>, UniversalAutomaton<S,I,T,SP,TP>, UniversalDeterministicAutomaton<S,I,T,SP,TP>, UniversalDTS<S,I,T,SP,TP>, UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>

All Known Implementing Classes:

AbstractBricsAutomaton, AbstractCompact, AbstractCompactDeterministic, AbstractCompactMTS, AbstractCompactSimpleDeterministic, AbstractCompactSimpleNondet, AbstractDefaultSEVPA, AbstractFastMutable, AbstractFastMutableDet, AbstractFastMutableNondet, AbstractSEVPA, BricsDFA, BricsNFA, CompactDFA, CompactMealy, CompactMoore, CompactMTS, CompactNFA, CompactSST, DefaultNSEVPA, DefaultOneSEVPA, DFALassoImpl, EmptySBA, EmptySPA, EmptySPMM, FastDFA, FastMealy, FastMoore, FastNFA, FastProbMealy, MealyLassoImpl, ProductOneSEVPA, StackSBA, StackSPA, StackSPMM, UniversalCompactDet, UniversalCompactSimpleDet

public interface UniversalTransitionSystem<S,I,T,SP,TP>
extends TransitionSystem<S,I,T>

A "universal" transition system, which captures the possibility to assign properties to states and transitions.

Generally speaking, these properties capture characteristics which are in general observable from the outside, but not captured by the 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.

Method Summary

Modifier and Type	Method	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.

Methods inherited from interface net.automatalib.ts.simple.SimpleTS

createDynamicStateMapping, createStaticStateMapping, getInitialStates, getStates, getSuccessors, getSuccessors

Methods inherited from interface net.automatalib.ts.TransitionSystem

getSuccessor, getSuccessors, getTransitions, powersetView

Method Detail

getStateProperty

SP getStateProperty(S state)

Retrieves the state property for the given state.

Parameters:

state - the state.

Returns:

the corresponding property.

getTransitionProperty

TP getTransitionProperty(T transition)

Retrieves the transition property for the given state.

Parameters:

transition - the transition.

Returns:

the corresponding property.