Package | Description |
---|---|
de.learnlib.algorithms.ttt.base | |
de.learnlib.algorithms.ttt.dfa | |
de.learnlib.algorithms.ttt.mealy |
Modifier and Type | Field and Description |
---|---|
TTTState<I,D> |
OutputInconsistency.srcState |
TTTState<I,D> |
AbstractTTTHypothesis.TTTEdge.target |
Modifier and Type | Field and Description |
---|---|
protected List<TTTState<I,D>> |
AbstractTTTHypothesis.states |
Modifier and Type | Method and Description |
---|---|
TTTState<I,D> |
AbstractBaseDTNode.anySubtreeState() |
TTTState<I,D> |
AbstractTTTHypothesis.createState(TTTTransition<I,D> parent) |
protected TTTState<I,D> |
AbstractTTTLearner.getAnySuccessor(TTTState<I,D> state,
I sym) |
protected TTTState<I,D> |
AbstractTTTLearner.getAnySuccessor(TTTState<I,D> state,
Iterable<? extends I> suffix) |
protected TTTState<I,D> |
AbstractTTTLearner.getAnyTarget(TTTTransition<I,D> trans)
Retrieves the target state of a given transition.
|
protected TTTState<I,D> |
AbstractTTTLearner.getDeterministicState(TTTState<I,D> start,
net.automatalib.words.Word<I> word) |
TTTState<I,D> |
AbstractTTTHypothesis.getInitialState() |
TTTState<I,D> |
TTTTransition.getSource() |
TTTState<I,D> |
TTTTransition.getTarget() |
TTTState<I,D> |
AbstractTTTHypothesis.GraphView.getTarget(AbstractTTTHypothesis.TTTEdge<I,D> edge) |
TTTState<I,D> |
TTTTransition.getTreeTarget() |
TTTState<I,D> |
AbstractTTTHypothesis.initialize()
Initializes the automaton, adding an initial state.
|
protected TTTState<I,D> |
AbstractTTTLearner.makeTree(TTTTransition<I,D> trans) |
protected TTTState<I,D> |
AbstractTTTHypothesis.newState(int alphabetSize,
TTTTransition<I,D> parent,
int id) |
Modifier and Type | Method and Description |
---|---|
Collection<TTTState<I,D>> |
AbstractTTTHypothesis.GraphView.getNodes() |
protected Set<TTTState<I,D>> |
AbstractTTTLearner.getNondetSuccessors(Collection<? extends TTTState<I,D>> states,
I sym) |
Collection<TTTState<I,D>> |
AbstractTTTHypothesis.getStates() |
net.automatalib.visualization.VisualizationHelper<TTTState<I,D>,AbstractTTTHypothesis.TTTEdge<I,D>> |
AbstractTTTHypothesis.GraphView.getVisualizationHelper() |
Iterable<TTTState<I,D>> |
AbstractBaseDTNode.subtreeStates() |
Iterator<TTTState<I,D>> |
AbstractBaseDTNode.subtreeStatesIterator() |
Modifier and Type | Method and Description |
---|---|
protected abstract D |
AbstractTTTLearner.computeHypothesisOutput(TTTState<I,D> state,
net.automatalib.words.Word<I> suffix) |
protected TTTTransition<I,D> |
AbstractTTTLearner.createTransition(TTTState<I,D> state,
I sym) |
void |
TTTEventListener.ensureConsistency(TTTState<I,D> state,
AbstractBaseDTNode<I,D> dtNode,
D realOutcome) |
protected TTTState<I,D> |
AbstractTTTLearner.getAnySuccessor(TTTState<I,D> state,
I sym) |
protected TTTState<I,D> |
AbstractTTTLearner.getAnySuccessor(TTTState<I,D> state,
Iterable<? extends I> suffix) |
protected TTTState<I,D> |
AbstractTTTLearner.getDeterministicState(TTTState<I,D> start,
net.automatalib.words.Word<I> word) |
TTTTransition<I,D> |
AbstractTTTHypothesis.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> |
AbstractTTTHypothesis.getInternalTransition(TTTState<I,D> state,
int input) |
Collection<AbstractTTTHypothesis.TTTEdge<I,D>> |
AbstractTTTHypothesis.GraphView.getOutgoingEdges(TTTState<I,D> node) |
protected TTTTransition<I,D> |
AbstractTTTLearner.getStateTransition(TTTState<I,D> state,
I sym) |
T |
AbstractTTTHypothesis.getTransition(TTTState<I,D> state,
I input) |
protected void |
AbstractTTTLearner.initializeState(TTTState<I,D> state)
Initializes a state.
|
protected static <I,D> void |
AbstractTTTLearner.link(AbstractBaseDTNode<I,D> dtNode,
TTTState<I,D> state)
Establish the connection between a node in the discrimination tree and a state of the hypothesis.
|
Modifier and Type | Method and Description |
---|---|
protected Set<TTTState<I,D>> |
AbstractTTTLearner.getNondetSuccessors(Collection<? extends TTTState<I,D>> states,
I sym) |
Constructor and Description |
---|
OutputInconsistency(TTTState<I,D> srcState,
net.automatalib.words.Word<I> suffix,
D targetOut) |
TTTEdge(TTTTransition<I,D> transition,
TTTState<I,D> target) |
TTTTransition(TTTState<I,D> source,
I input) |
Modifier and Type | Class and Description |
---|---|
class |
TTTStateDFA<I> |
Modifier and Type | Method and Description |
---|---|
TTTState<I,Boolean> |
TTTHypothesisDFA.getSuccessor(TTTState<I,Boolean> transition) |
protected TTTState<I,Boolean> |
PrefixTTTLearnerDFA.makeTree(TTTTransition<I,Boolean> trans) |
protected TTTState<I,Boolean> |
TTTHypothesisDFA.mapTransition(TTTTransition<I,Boolean> internalTransition) |
protected TTTState<I,Boolean> |
TTTHypothesisDFA.newState(int alphabetSize,
TTTTransition<I,Boolean> parent,
int id) |
Modifier and Type | Method and Description |
---|---|
net.automatalib.automata.UniversalDeterministicAutomaton.FullIntAbstraction<TTTState<I,Boolean>,Boolean,Void> |
TTTHypothesisDFA.fullIntAbstraction(net.automatalib.words.Alphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
protected Boolean |
TTTLearnerDFA.computeHypothesisOutput(TTTState<I,Boolean> state,
net.automatalib.words.Word<I> suffix) |
protected PrefixTTTLearnerDFA.ExtDTNode<I> |
PrefixTTTLearnerDFA.ExtDTNode.createChild(Boolean outcome,
TTTState<I,Boolean> data) |
protected AbstractBaseDTNode<I,Boolean> |
TTTDTNodeDFA.createChild(Boolean outcome,
TTTState<I,Boolean> data) |
TTTState<I,Boolean> |
TTTHypothesisDFA.getSuccessor(TTTState<I,Boolean> transition) |
Void |
TTTHypothesisDFA.getTransitionProperty(TTTState<I,Boolean> transition) |
protected void |
TTTLearnerDFA.initializeState(TTTState<I,Boolean> state) |
boolean |
TTTHypothesisDFA.isAccepting(TTTState<I,Boolean> state) |
Modifier and Type | Method and Description |
---|---|
TTTState<I,net.automatalib.words.Word<O>> |
TTTHypothesisMealy.getSuccessor(TTTTransitionMealy<I,O> transition) |
Modifier and Type | Method and Description |
---|---|
protected net.automatalib.words.Word<O> |
TTTLearnerMealy.computeHypothesisOutput(TTTState<I,net.automatalib.words.Word<O>> state,
net.automatalib.words.Word<I> suffix) |
protected AbstractBaseDTNode<I,D> |
TTTDTNodeMealy.createChild(D outcome,
TTTState<I,D> data) |
protected TTTTransition<I,net.automatalib.words.Word<O>> |
TTTLearnerMealy.createTransition(TTTState<I,net.automatalib.words.Word<O>> state,
I sym) |
Constructor and Description |
---|
TTTTransitionMealy(TTTState<I,net.automatalib.words.Word<O>> source,
I input) |
Copyright © 2018. All rights reserved.