I
- input symbol typepublic abstract class TTTHypothesis<I,D,T> extends Object implements net.automatalib.automata.DeterministicAutomaton<TTTState<I,D>,I,T>, net.automatalib.automata.FiniteAlphabetAutomaton<TTTState<I,D>,I,T>, net.automatalib.automata.DeterministicAutomaton.FullIntAbstraction<T>
TTT algorithm
.Modifier and Type | Class and Description |
---|---|
class |
TTTHypothesis.GraphView |
static class |
TTTHypothesis.TTTEdge<I,D> |
net.automatalib.automata.DeterministicAutomaton.FullIntAbstraction<T>, net.automatalib.automata.DeterministicAutomaton.IntAbstraction<T>, net.automatalib.automata.DeterministicAutomaton.StateIntAbstraction<I,T>
Modifier and Type | Field and Description |
---|---|
protected net.automatalib.words.Alphabet<I> |
alphabet |
protected List<TTTState<I,D>> |
states |
Constructor and Description |
---|
TTTHypothesis(net.automatalib.words.Alphabet<I> alphabet)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
TTTState<I,D> |
createState(TTTTransition<I,D> parent) |
net.automatalib.automata.DeterministicAutomaton.FullIntAbstraction<T> |
fullIntAbstraction(net.automatalib.words.Alphabet<I> alphabet) |
TTTState<I,D> |
getInitialState() |
net.automatalib.words.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. |
TTTTransition<I,D> |
getInternalTransition(TTTState<I,D> state,
int input) |
int |
getIntInitialState() |
int |
getIntSuccessor(T trans) |
Collection<TTTState<I,D>> |
getStates() |
T |
getTransition(int stateId,
int symIdx) |
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) |
int |
numInputs() |
int |
size() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
fullIntAbstraction, stateIntAbstraction
getSuccessor, getSuccessors, getTransitions, transToSet
getInitialStates, getState, getStates, getSuccessor, getSuccessors, stateToSet
transitionGraphView
createStaticStateMapping, iterator, stateIDs
createDynamicStateMapping, getSuccessors
forEach, spliterator
protected final net.automatalib.words.Alphabet<I> alphabet
public TTTHypothesis(net.automatalib.words.Alphabet<I> alphabet)
alphabet
- the input alphabetpublic int size()
public Collection<TTTState<I,D>> getStates()
protected abstract T mapTransition(TTTTransition<I,D> internalTransition)
public boolean isInitialized()
initialize()
has been called).true
if this automaton was initialized, false
otherwise.public TTTState<I,D> initialize()
public TTTTransition<I,D> getInternalTransition(TTTState<I,D> state, I input)
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.state
- the source stateinput
- the input symbol triggering the transitionpublic TTTTransition<I,D> getInternalTransition(TTTState<I,D> state, int input)
public net.automatalib.words.Alphabet<I> getInputAlphabet()
getInputAlphabet
in interface net.automatalib.automata.concepts.InputAlphabetHolder<I>
public TTTHypothesis.GraphView graphView()
public T getTransition(int stateId, int symIdx)
getTransition
in interface net.automatalib.automata.DeterministicAutomaton.FullIntAbstraction<T>
public int getIntInitialState()
getIntInitialState
in interface net.automatalib.automata.simple.SimpleDeterministicAutomaton.IntAbstraction
public int numInputs()
numInputs
in interface net.automatalib.automata.simple.SimpleDeterministicAutomaton.FullIntAbstraction
public int getIntSuccessor(T trans)
getIntSuccessor
in interface net.automatalib.automata.DeterministicAutomaton.IntAbstraction<T>
Copyright © 2016. All rights reserved.