de.learnlib.algorithms.ttt.base

Class TTTHypothesis<I,D,T>

java.lang.Object

de.learnlib.algorithms.ttt.base.TTTHypothesis<I,D,T>

Type Parameters:

I - input symbol type

All Implemented Interfaces:

Iterable<TTTState<I,D>>, Automaton<TTTState<I,D>,I,T>, InputAlphabetHolder<I>, DeterministicAutomaton<TTTState<I,D>,I,T>, FiniteAlphabetAutomaton<TTTState<I,D>,I,T>, SimpleAutomaton<TTTState<I,D>,I>, SimpleDeterministicAutomaton<TTTState<I,D>,I>, GraphViewable, DeterministicTransitionSystem<TTTState<I,D>,I,T>, SimpleDTS<TTTState<I,D>,I>, SimpleTS<TTTState<I,D>,I>, TransitionSystem<TTTState<I,D>,I,T>

Direct Known Subclasses:

TTTHypothesisDFA, TTTHypothesisMealy

public abstract class TTTHypothesis<I,D,T>
extends Object
implements DeterministicAutomaton<TTTState<I,D>,I,T>, FiniteAlphabetAutomaton<TTTState<I,D>,I,T>

Hypothesis DFA for the TTT algorithm.

Author:

Malte Isberner

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	TTTHypothesis.GraphView
static class	TTTHypothesis.TTTEdge<I,D>

Field Summary

Fields

Modifier and Type	Field and Description
protected Alphabet<I>	alphabet

Constructor Summary

Constructors

Constructor and Description
TTTHypothesis(Alphabet<I> alphabet) Constructor.

Method Summary

Modifier and Type	Method and Description
TTTState<I,D>	createState(TTTTransition<I,D> parent)
TTTState<I,D>	getInitialState()
Alphabet<I>	getInputAlphabet()
TTTTransition<I,D>	getInternalTransition(TTTState<I,D> state, I input) Retrieves the internal transition (i.e., the TTTTransition object) for a given state and input.
Collection<TTTState<I,D>>	getStates()
T	getTransition(TTTState<I,D> state, I input)
TTTHypothesis.GraphView	graphView()
TTTState<I,D>	initialize() Initializes the automaton, adding an initial state.
boolean	isInitialized() Checks whether this automaton was initialized (i.e., initialize() has been called).
protected abstract T	mapTransition(TTTTransition<I,D> internalTransition)
protected TTTState<I,D>	newState(int alphabetSize, TTTTransition<I,D> parent, int id)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface net.automatalib.ts.DeterministicTransitionSystem

getSuccessor, getSuccessors, getTransitions, transToSet

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

getInitialStates, getState, getStates, getSuccessor, getSuccessors, stateToSet

Methods inherited from interface net.automatalib.automata.FiniteAlphabetAutomaton

transitionGraphView

Methods inherited from interface net.automatalib.automata.Automaton

transitionGraphView

Methods inherited from interface net.automatalib.ts.TransitionSystem

getSuccessor, powersetView

Methods inherited from interface net.automatalib.automata.simple.SimpleAutomaton

createStaticStateMapping, iterator, size, stateIDs

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

createDynamicStateMapping, getSuccessors

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Detail

alphabet

protected final Alphabet<I> alphabet

Constructor Detail

TTTHypothesis

public TTTHypothesis(Alphabet<I> alphabet)

Constructor.

Parameters:

alphabet - the input alphabet

Method Detail

getStates

public Collection<TTTState<I,D>> getStates()

Specified by:

getStates in interface SimpleAutomaton<TTTState<I,D>,I>

getInitialState

public TTTState<I,D> getInitialState()

Specified by:

getInitialState in interface SimpleDTS<TTTState<I,D>,I>

getTransition

public T getTransition(TTTState<I,D> state,
                       I input)

Specified by:

getTransition in interface DeterministicTransitionSystem<TTTState<I,D>,I,T>

mapTransition

protected abstract T mapTransition(TTTTransition<I,D> internalTransition)

isInitialized

public boolean isInitialized()

Checks whether this automaton was initialized (i.e., initialize() has been called).

Returns:

true if this automaton was initialized, false otherwise.

initialize

public TTTState<I,D> initialize()

Initializes the automaton, adding an initial state. Whether or not the initial state is accepting needs to be known at this point.

Returns:

the initial state of this newly initialized automaton

getInternalTransition

public TTTTransition<I,D> getInternalTransition(TTTState<I,D> state,
                                                I input)

Retrieves the internal transition (i.e., the TTTTransition object) for a given state and input. This method is required since the DFA interface requires the return value of getTransition(TTTState, Object) to refer to the successor state directly.

Parameters:

state - the source state

input - the input symbol triggering the transition

Returns:

the transition object

createState

public TTTState<I,D> createState(TTTTransition<I,D> parent)

newState

protected TTTState<I,D> newState(int alphabetSize,
                                 TTTTransition<I,D> parent,
                                 int id)

getInputAlphabet

public Alphabet<I> getInputAlphabet()

Specified by:

getInputAlphabet in interface InputAlphabetHolder<I>

graphView

public TTTHypothesis.GraphView graphView()

Specified by:

graphView in interface FiniteAlphabetAutomaton<TTTState<I,D>,I,T>

Specified by:

graphView in interface GraphViewable