Package | Description |
---|---|
de.learnlib.algorithms.ttt.base | |
de.learnlib.algorithms.ttt.dfa | |
de.learnlib.algorithms.ttt.mealy |
Modifier and Type | Field and Description |
---|---|
protected DTNode<I,D> |
BlockListElem.nextBlock |
DTNode<I,D> |
BaseTTTLearner.Splitter.succSeparator |
Modifier and Type | Method and Description |
---|---|
DTNode<I,D> |
DTNode.anyChild() |
DTNode<I,D> |
DTNode.child(D value) |
DTNode<I,D> |
BlockList.chooseBlock()
Retrieves any block from the list.
|
protected DTNode<I,D> |
DTNode.createChild(DTNode<I,D> parent,
D parentOut) |
DTNode<I,D> |
DTNode.getChild(D value) |
DTNode<I,D> |
TTTState.getDTLeaf()
Retrieves the discrimination tree leaf associated with this state.
|
DTNode<I,D> |
TTTTransition.getDTTarget() |
DTNode<I,D> |
DTNode.getExtremalChild(D label) |
DTNode<I,D> |
TTTTransition.getNonTreeTarget() |
DTNode<I,D> |
DTNode.getParent() |
DTNode<I,D> |
DiscriminationTree.getRoot()
Retrieves the root node of this tree.
|
DTNode<I,D> |
DiscriminationTree.GraphView.getTarget(DTNode<I,D> edge) |
DTNode<I,D> |
DiscriminationTree.leastCommonAncestor(DTNode<I,D> node1,
DTNode<I,D> node2) |
DTNode<I,D> |
DiscriminationTree.sift(AccessSequenceProvider<I> asp)
Sifts an access sequence provided by an object into the tree, starting
at the root.
|
DTNode<I,D> |
DiscriminationTree.sift(AccessSequenceProvider<I> asp,
boolean hard)
Sifts an access sequence provided by an object into the tree,
starting at the root.
|
DTNode<I,D> |
DiscriminationTree.sift(DTNode<I,D> start,
AccessSequenceProvider<I> asp,
boolean hard) |
DTNode<I,D> |
DiscriminationTree.sift(DTNode<I,D> start,
net.automatalib.words.Word<I> word,
boolean hard) |
DTNode<I,D> |
DiscriminationTree.sift(net.automatalib.words.Word<I> word) |
DTNode<I,D> |
DiscriminationTree.sift(net.automatalib.words.Word<I> word,
boolean hard) |
protected DTNode<I,D>[] |
BaseTTTLearner.split(DTNode<I,D> node,
net.automatalib.words.Word<I> discriminator,
D... outputs) |
Modifier and Type | Method and Description |
---|---|
Collection<? extends Map.Entry<D,DTNode<I,D>>> |
DTNode.getChildEntries() |
Collection<? extends DTNode<I,D>> |
DTNode.getChildren() |
net.automatalib.graphs.dot.GraphDOTHelper<DTNode<I,D>,DTNode<I,D>> |
DiscriminationTree.GraphView.getGraphDOTHelper() |
net.automatalib.graphs.dot.GraphDOTHelper<DTNode<I,D>,DTNode<I,D>> |
DiscriminationTree.GraphView.getGraphDOTHelper() |
Collection<? extends DTNode<I,D>> |
DiscriminationTree.GraphView.getNodes() |
Collection<? extends DTNode<I,D>> |
DiscriminationTree.GraphView.getOutgoingEdges(DTNode<I,D> node) |
Iterable<DTNode<I,D>> |
DTNode.innerNodes() |
Iterator<DTNode<I,D>> |
DTNode.innerNodesIterator() |
Iterator<DTNode<I,D>> |
BlockList.iterator() |
Iterable<DTNode<I,D>> |
DTNode.subtreeLeaves() |
Iterator<DTNode<I,D>> |
DTNode.subtreeLeavesIterator() |
Iterator<DTNode<I,D>> |
DTNode.subtreeNodesIterator() |
Modifier and Type | Method and Description |
---|---|
protected DTNode<I,D> |
DTNode.createChild(DTNode<I,D> parent,
D parentOut) |
protected void |
BaseTTTLearner.declareFinal(DTNode<I,D> blockRoot) |
void |
TTTEventListener.ensureConsistency(TTTState<I,D> state,
DTNode<I,D> dtNode,
D realOutcome) |
Collection<? extends DTNode<I,D>> |
DiscriminationTree.GraphView.getOutgoingEdges(DTNode<I,D> node) |
DTNode<I,D> |
DiscriminationTree.GraphView.getTarget(DTNode<I,D> edge) |
void |
BlockList.insertBlock(DTNode<I,D> blockRoot)
Inserts a block into the list.
|
DTNode<I,D> |
DiscriminationTree.leastCommonAncestor(DTNode<I,D> node1,
DTNode<I,D> node2) |
DTNode<I,D> |
DiscriminationTree.leastCommonAncestor(DTNode<I,D> node1,
DTNode<I,D> node2) |
protected static <I,D> void |
BaseTTTLearner.link(DTNode<I,D> dtNode,
TTTState<I,D> state)
Establish the connection between a node in the discrimination tree
and a state of the hypothesis.
|
void |
TTTEventListener.postFinalizeDiscriminator(DTNode<I,D> blockRoot,
BaseTTTLearner.Splitter<I,D> splitter) |
protected abstract D |
BaseTTTLearner.predictSuccOutcome(TTTTransition<I,D> trans,
DTNode<I,D> succSeparator) |
void |
TTTEventListener.preFinalizeDiscriminator(DTNode<I,D> blockRoot,
BaseTTTLearner.Splitter<I,D> splitter) |
void |
DTNode.setChild(D label,
DTNode<I,D> newChild) |
DTNode<I,D> |
DiscriminationTree.sift(DTNode<I,D> start,
AccessSequenceProvider<I> asp,
boolean hard) |
DTNode<I,D> |
DiscriminationTree.sift(DTNode<I,D> start,
net.automatalib.words.Word<I> word,
boolean hard) |
protected DTNode<I,D>[] |
BaseTTTLearner.split(DTNode<I,D> node,
net.automatalib.words.Word<I> discriminator,
D... outputs) |
D |
DTNode.subtreeLabel(DTNode<I,D> descendant) |
Constructor and Description |
---|
BaseTTTLearner(net.automatalib.words.Alphabet<I> alphabet,
MembershipOracle<I,D> oracle,
TTTHypothesis<I,D,?> hypothesis,
AcexAnalyzer analyzer,
DTNode<I,D> root) |
DiscriminationTree(MembershipOracle<I,D> oracle,
DTNode<I,D> root) |
DTNode(DTNode<I,D> parent,
D parentEdgeLabel) |
Splitter(int symbolIdx,
DTNode<I,D> succSeparator) |
Modifier and Type | Method and Description |
---|---|
protected Boolean |
TTTLearnerDFA.predictSuccOutcome(TTTTransition<I,Boolean> trans,
DTNode<I,Boolean> succSeparator) |
Constructor and Description |
---|
TTTLearnerDFA(net.automatalib.words.Alphabet<I> alphabet,
MembershipOracle<I,Boolean> oracle,
AcexAnalyzer analyzer,
DTNode<I,Boolean> root) |
Modifier and Type | Method and Description |
---|---|
protected net.automatalib.words.Word<O> |
TTTLearnerMealy.predictSuccOutcome(TTTTransition<I,net.automatalib.words.Word<O>> trans,
DTNode<I,net.automatalib.words.Word<O>> succSeparator) |
Copyright © 2016. All rights reserved.