A B C D E F G H I L M N O P Q R S T V W 
All Classes All Packages

A

AbstractCalculator - Class in de.learnlib.algorithm.adt.config.model.calculator
 
AbstractCalculator() - Constructor for class de.learnlib.algorithm.adt.config.model.calculator.AbstractCalculator
 
addAlphabetSymbol(I) - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
addState(S, Word<I>, O) - Method in class de.learnlib.algorithm.adt.model.ObservationTree
Registers a new hypothesis state at the observation tree.
addTrace(S, ADTNode<S, I, O>) - Method in class de.learnlib.algorithm.adt.model.ObservationTree
addTrace(S, Word<I>, Word<O>) - Method in class de.learnlib.algorithm.adt.model.ObservationTree
Store input/output information about a hypothesis state in the internal data structure.
ADSCalculator - Interface in de.learnlib.algorithm.adt.config.model
 
ADT<S,​I,​O> - Class in de.learnlib.algorithm.adt.adt
The adaptive discrimination tree class.
ADT() - Constructor for class de.learnlib.algorithm.adt.adt.ADT
 
ADT.LCAInfo<S,​I,​O> - Class in de.learnlib.algorithm.adt.adt
 
ADTExtender - Interface in de.learnlib.algorithm.adt.api
Interface for configuration objects that specify how to finalize the temporary splitter given by regular counterexample decomposition.
ADTExtenders - Class in de.learnlib.algorithm.adt.config
A collection of default ADTExtender configurations.
ADTHypothesis<I,​O> - Class in de.learnlib.algorithm.adt.automaton
Hypothesis model.
ADTHypothesis(Alphabet<I>) - Constructor for class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 
ADTLeafNode<S,​I,​O> - Class in de.learnlib.algorithm.adt.adt
Leaf node implementation.
ADTLeafNode(ADTNode<S, I, O>, S) - Constructor for class de.learnlib.algorithm.adt.adt.ADTLeafNode
 
ADTLearner<I,​O> - Class in de.learnlib.algorithm.adt.learner
The main learning algorithm.
ADTLearner(Alphabet<I>, SymbolQueryOracle<I, O>, LeafSplitter, ADTExtender, SubtreeReplacer) - Constructor for class de.learnlib.algorithm.adt.learner.ADTLearner
 
ADTLearner(Alphabet<I>, SymbolQueryOracle<I, O>, LeafSplitter, ADTExtender, SubtreeReplacer, boolean) - Constructor for class de.learnlib.algorithm.adt.learner.ADTLearner
 
ADTLearnerBuilder<I,​O> - Class in de.learnlib.algorithm.adt.learner
 
ADTLearnerBuilder() - Constructor for class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
ADTLearnerState<S,​I,​O> - Class in de.learnlib.algorithm.adt.learner
Utility class that captures all essential state of a ADTLearner run.
adtNode - Variable in class de.learnlib.algorithm.adt.adt.ADT.LCAInfo
 
ADTNode<S,​I,​O> - Interface in de.learnlib.algorithm.adt.adt
The ADT equivalent of ADSNode.
ADTNode.NodeType - Enum in de.learnlib.algorithm.adt.adt
Utility enum to distinguish the 3 possible types of ADT nodes.
ADTResetNode<S,​I,​O> - Class in de.learnlib.algorithm.adt.adt
Reset node implementation.
ADTResetNode(ADTNode<S, I, O>) - Constructor for class de.learnlib.algorithm.adt.adt.ADTResetNode
 
ADTState<I,​O> - Class in de.learnlib.algorithm.adt.automaton
Hypothesis state model.
ADTState(int) - Constructor for class de.learnlib.algorithm.adt.automaton.ADTState
 
ADTSymbolNode<S,​I,​O> - Class in de.learnlib.algorithm.adt.adt
Symbol node implementation.
ADTSymbolNode(ADTNode<S, I, O>, I) - Constructor for class de.learnlib.algorithm.adt.adt.ADTSymbolNode
 
ADTTransition<I,​O> - Class in de.learnlib.algorithm.adt.automaton
Hypothesis transition model.
ADTTransition() - Constructor for class de.learnlib.algorithm.adt.automaton.ADTTransition
 
ADTUtil - Class in de.learnlib.algorithm.adt.util
Utility class, that offers some operations revolving around adaptive distinguishing sequences.

B

BestEffortCalculator - Class in de.learnlib.algorithm.adt.config.model.calculator
 
BestEffortCalculator() - Constructor for class de.learnlib.algorithm.adt.config.model.calculator.BestEffortCalculator
 
BestEffortDefensiveCalculator - Class in de.learnlib.algorithm.adt.config.model.calculator
 
BestEffortDefensiveCalculator() - Constructor for class de.learnlib.algorithm.adt.config.model.calculator.BestEffortDefensiveCalculator
 
buildADSFromObservation(Word<I>, Word<O>, S) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
Build a single trace ADS from the given information.
buildADSFromTrace(MealyMachine<S, I, ?, O>, Word<I>, S) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
buildFromADS(ADSNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
Utility method that wraps an ADS of type ADSNode into the equivalent ADS of type ADTNode.
buildTraceForNode(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 

C

clearTransitionObject(ADTTransition<I, O>) - Method in class de.learnlib.algorithm.adt.automaton.ADTState
 
closeTransition(ADTState<I, O>, I) - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
closeTransition(S, I) - Method in interface de.learnlib.algorithm.adt.api.PartialTransitionAnalyzer
Determine the successor/output of the transition in question (which is usually achieved by sifting the corresponding long-prefix through the ADT).
collectADSNodes(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
collectDirectSubADSs(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
collectHypothesisStates(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
collectLeaves(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
collectResetNodes(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
compute(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Method in interface de.learnlib.algorithm.adt.config.model.ADSCalculator
 
compute(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Method in class de.learnlib.algorithm.adt.config.model.calculator.AbstractCalculator
 
compute(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>, PartialTransitionAnalyzer<S, I>) - Static method in class de.learnlib.algorithm.adt.ads.DefensiveADS
Compute an adaptive distinguishing sequence (as an ADT) for the given automaton and the given set of states.
compute(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>, PartialTransitionAnalyzer<S, I>) - Method in class de.learnlib.algorithm.adt.config.model.calculator.BestEffortDefensiveCalculator
 
compute(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>, PartialTransitionAnalyzer<S, I>) - Method in interface de.learnlib.algorithm.adt.config.model.DefensiveADSCalculator
 
computeEffectiveResets(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
Computes how often reset nodes are encountered when traversing from the given node to the leaves of the induced subtree of the given node.
computeExtension(ADTHypothesis<I, O>, PartialTransitionAnalyzer<ADTState<I, O>, I>, ADTNode<ADTState<I, O>, I, O>) - Method in interface de.learnlib.algorithm.adt.api.ADTExtender
Compute the ADT whose root node should replace the root of the temporary splitter in the current ADT.
computeExtension(ADTHypothesis<I, O>, PartialTransitionAnalyzer<ADTState<I, O>, I>, ADTNode<ADTState<I, O>, I, O>) - Method in class de.learnlib.algorithm.adt.config.model.extender.DefaultExtender
 
computeInternal(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Method in class de.learnlib.algorithm.adt.config.model.calculator.AbstractCalculator
 
computeInternal(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Method in class de.learnlib.algorithm.adt.config.model.calculator.BestEffortCalculator
 
computeInternal(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Method in class de.learnlib.algorithm.adt.config.model.calculator.MinLengthCalculator
 
computeInternal(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Method in class de.learnlib.algorithm.adt.config.model.calculator.MinSizeCalculator
 
computeReplacements(MealyMachine<S, I, ?, O>, Alphabet<I>, ADT<S, I, O>) - Method in interface de.learnlib.algorithm.adt.api.SubtreeReplacer
Compute how certain nodes of the ADT should be replaced.
computeReplacements(MealyMachine<S, I, ?, O>, Alphabet<I>, ADT<S, I, O>) - Method in class de.learnlib.algorithm.adt.config.model.replacer.ExhaustiveReplacer
 
computeReplacements(MealyMachine<S, I, ?, O>, Alphabet<I>, ADT<S, I, O>) - Method in class de.learnlib.algorithm.adt.config.model.replacer.LevelOrderReplacer
 
computeReplacements(MealyMachine<S, I, ?, O>, Alphabet<I>, ADT<S, I, O>) - Method in class de.learnlib.algorithm.adt.config.model.replacer.SingleReplacer
 
create() - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
createOpenTransition(ADTState<I, O>, I, ADTNode<ADTState<I, O>, I, O>) - Method in class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 
createState(Void) - Method in class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 
createTransition(ADTState<I, O>, O) - Method in class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 

D

de.learnlib.algorithm.adt - package de.learnlib.algorithm.adt
This package (and sub-packages) provides the implementation of the ADT learning algorithm as described in the Master thesis Active Automata Learning with Adaptive Distinguishing Sequences by Markus Frohme.
de.learnlib.algorithm.adt.ads - package de.learnlib.algorithm.adt.ads
 
de.learnlib.algorithm.adt.adt - package de.learnlib.algorithm.adt.adt
 
de.learnlib.algorithm.adt.api - package de.learnlib.algorithm.adt.api
 
de.learnlib.algorithm.adt.automaton - package de.learnlib.algorithm.adt.automaton
 
de.learnlib.algorithm.adt.config - package de.learnlib.algorithm.adt.config
 
de.learnlib.algorithm.adt.config.model - package de.learnlib.algorithm.adt.config.model
 
de.learnlib.algorithm.adt.config.model.calculator - package de.learnlib.algorithm.adt.config.model.calculator
 
de.learnlib.algorithm.adt.config.model.extender - package de.learnlib.algorithm.adt.config.model.extender
 
de.learnlib.algorithm.adt.config.model.replacer - package de.learnlib.algorithm.adt.config.model.replacer
 
de.learnlib.algorithm.adt.learner - package de.learnlib.algorithm.adt.learner
 
de.learnlib.algorithm.adt.model - package de.learnlib.algorithm.adt.model
 
de.learnlib.algorithm.adt.util - package de.learnlib.algorithm.adt.util
 
DEFAULT_SPLITTER - Static variable in class de.learnlib.algorithm.adt.config.LeafSplitters
 
DefaultExtender - Class in de.learnlib.algorithm.adt.config.model.extender
 
DefaultExtender(DefensiveADSCalculator) - Constructor for class de.learnlib.algorithm.adt.config.model.extender.DefaultExtender
 
DefensiveADS<S,​I,​O> - Class in de.learnlib.algorithm.adt.ads
A variant of the backtracking ADS search (see ADS, BacktrackingSearch), that works on partially defined automata.
DefensiveADSCalculator - Interface in de.learnlib.algorithm.adt.config.model
 

E

empty() - Static method in class de.learnlib.algorithm.adt.model.ExtensionResult
Utility method, returning the (singleton) object indicating, no result could be computed.
EXHAUSTIVE_BEST_EFFORT - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
EXHAUSTIVE_MIN_LENGTH - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
EXHAUSTIVE_MIN_SIZE - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
ExhaustiveReplacer - Class in de.learnlib.algorithm.adt.config.model.replacer
 
ExhaustiveReplacer(ADSCalculator) - Constructor for class de.learnlib.algorithm.adt.config.model.replacer.ExhaustiveReplacer
 
EXTEND_BEST_EFFORT - Static variable in class de.learnlib.algorithm.adt.config.ADTExtenders
 
EXTEND_PARENT - Static variable in class de.learnlib.algorithm.adt.config.LeafSplitters
 
extendLeaf(ADTNode<S, I, O>, Word<I>, Word<O>, Word<O>, LeafSplitter) - Method in class de.learnlib.algorithm.adt.adt.ADT
Splitting a leaf node by extending the trace leading into the node to split.
ExtensionResult<S,​I,​O> - Class in de.learnlib.algorithm.adt.model
A class that describes the possible result a ADTExtender can return.
ExtensionResult(ADTNode<S, I, O>) - Constructor for class de.learnlib.algorithm.adt.model.ExtensionResult
 
ExtensionResult(DefaultQuery<I, Word<O>>) - Constructor for class de.learnlib.algorithm.adt.model.ExtensionResult
 

F

fillInStackTrace() - Method in exception de.learnlib.algorithm.adt.api.PartialTransitionAnalyzer.HypothesisModificationException
 
findLCA(ADTNode<S, I, O>, ADTNode<S, I, O>) - Method in class de.learnlib.algorithm.adt.adt.ADT
Return the lowest common ancestor for the given two nodes.
findSeparatingWord(S, S) - Method in class de.learnlib.algorithm.adt.model.ObservationTree
Find a separating word for two hypothesis states.
findSeparatingWord(S, S, Word<I>) - Method in class de.learnlib.algorithm.adt.model.ObservationTree
Find a separating word for two hypothesis states, after applying given input sequence first.
firstOutput - Variable in class de.learnlib.algorithm.adt.adt.ADT.LCAInfo
 

G

getAccessSequence() - Method in class de.learnlib.algorithm.adt.automaton.ADTState
 
getADT() - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
getAdtExtender() - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
getAlphabet() - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
getChildren() - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
getCounterExample() - Method in class de.learnlib.algorithm.adt.model.ExtensionResult
Return the found counterexample.
getCutoutNodes() - Method in class de.learnlib.algorithm.adt.model.ReplacementResult
The set of hypothesis states that are not covered on the proposed replacement.
getHypothesisModel() - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
getHypothesisState() - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
getIncomingTransitions() - Method in class de.learnlib.algorithm.adt.automaton.ADTState
 
getInput() - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
getLeafSplitter() - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
getNodes() - Method in interface de.learnlib.algorithm.adt.adt.ADTNode
 
getNodeToReplace() - Method in class de.learnlib.algorithm.adt.model.ReplacementResult
The ADT subtree (root-node) that should be replaced.
getNodeType() - Method in class de.learnlib.algorithm.adt.adt.ADTLeafNode
 
getNodeType() - Method in interface de.learnlib.algorithm.adt.adt.ADTNode
Returns the node type of the current node.
getNodeType() - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
getNodeType() - Method in class de.learnlib.algorithm.adt.adt.ADTSymbolNode
 
getObservationTree() - Method in class de.learnlib.algorithm.adt.model.ObservationTree
 
getOracle() - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
getOutput() - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
getOutputForSuccessor(ADTNode<S, I, O>, ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
getParent() - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
getReplacement() - Method in class de.learnlib.algorithm.adt.model.ExtensionResult
Return the proposed replacement.
getReplacement() - Method in class de.learnlib.algorithm.adt.model.ReplacementResult
The ADT subtree (root-node) that forms the replacement.
getRoot() - Method in class de.learnlib.algorithm.adt.adt.ADT
Returns the root node of this ADT.
getSiftNode() - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
getSource() - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
getStartOfADS(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
getSubtreeReplacer() - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
getSuccessor(ADTTransition<I, O>) - Method in class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 
getSymbol() - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
getTarget() - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
getTransitionOutput(ADTTransition<I, O>) - Method in class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 
getUseObservationTree() - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
getVisualizationHelper() - Method in interface de.learnlib.algorithm.adt.adt.ADTNode
 

H

HYPOTHESIS_MODIFICATION_EXCEPTION - Static variable in interface de.learnlib.algorithm.adt.api.PartialTransitionAnalyzer
Global exception instance to avoid (unnecessary) re-instantiation.

I

initialize() - Method in class de.learnlib.algorithm.adt.util.SQOOTBridge
 
initialize(Collection<S>, Function<S, Word<I>>, Function<Word<I>, Word<O>>) - Method in class de.learnlib.algorithm.adt.model.ObservationTree
Extended initialization method, that allows to initialize the observation tree with several hypothesis states.
initialize(S) - Method in class de.learnlib.algorithm.adt.adt.ADT
Initializes the ADT with a single leaf node.
initialize(S) - Method in class de.learnlib.algorithm.adt.model.ObservationTree
Initialize the observation tree with initial hypothesis state.
isCounterExample() - Method in class de.learnlib.algorithm.adt.model.ExtensionResult
Utility method, indicating the search for an extension has revealed a counterexample.
isLeaf() - Method in interface de.learnlib.algorithm.adt.adt.ADTNode
 
isLeafNode(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
isReplacement() - Method in class de.learnlib.algorithm.adt.model.ExtensionResult
Utility method, indicating if the search for an extending replacement was a success.
isResetNode(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
isSpanningTreeEdge() - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
isSymbolNode(ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
 
isTransitionDefined(ADTState<I, O>, I) - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
isTransitionDefined(S, I) - Method in interface de.learnlib.algorithm.adt.api.PartialTransitionAnalyzer
Check whether the transition in question is defined or not.

L

LEAF_NODE - de.learnlib.algorithm.adt.adt.ADTNode.NodeType
 
LeafSplitter - Interface in de.learnlib.algorithm.adt.api
Interface for configuration objects that specify how to split the ADT leaf of a hypothesis state that needs refinement.
LeafSplitters - Class in de.learnlib.algorithm.adt.config
A collection of default LeafSplitter configurations.
LEVELED_BEST_EFFORT - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
LEVELED_MIN_LENGTH - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
LEVELED_MIN_SIZE - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
LevelOrderReplacer - Class in de.learnlib.algorithm.adt.config.model.replacer
 
LevelOrderReplacer(ADSCalculator) - Constructor for class de.learnlib.algorithm.adt.config.model.replacer.LevelOrderReplacer
 

M

mergeADS(ADTNode<S, I, O>, ADTNode<S, I, O>) - Static method in class de.learnlib.algorithm.adt.util.ADTUtil
Tries to merge the given (single trace) ADSs (which only contains one leaf) into the given parent ADSs.
MinLengthCalculator - Class in de.learnlib.algorithm.adt.config.model.calculator
 
MinLengthCalculator() - Constructor for class de.learnlib.algorithm.adt.config.model.calculator.MinLengthCalculator
 
MinSizeCalculator - Class in de.learnlib.algorithm.adt.config.model.calculator
 
MinSizeCalculator() - Constructor for class de.learnlib.algorithm.adt.config.model.calculator.MinSizeCalculator
 

N

needsSifting() - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
NEVER_REPLACE - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
NOP - Static variable in class de.learnlib.algorithm.adt.config.ADTExtenders
 

O

ObservationTree<S,​I,​O> - Class in de.learnlib.algorithm.adt.model
A class, that stores observations of the system under learning in a tree-like structure.
ObservationTree(Alphabet<I>) - Constructor for class de.learnlib.algorithm.adt.model.ObservationTree
 

P

PartialTransitionAnalyzer<S,​I> - Interface in de.learnlib.algorithm.adt.api
During the refinement process of the hypothesis, ADS/Ts may be computed on partially defined automata.
PartialTransitionAnalyzer.HypothesisModificationException - Exception in de.learnlib.algorithm.adt.api
A helper exception to interrupt computations on an invalid hypothesis.

Q

query(I) - Method in class de.learnlib.algorithm.adt.util.SQOOTBridge
 

R

refineHypothesis(DefaultQuery<I, Word<O>>) - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
refineHypothesisInternal(DefaultQuery<I, Word<O>>) - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
ReplacementResult<S,​I,​O> - Class in de.learnlib.algorithm.adt.model
A class that describes the possible result a SubtreeReplacer can return.
ReplacementResult(ADTNode<S, I, O>, ADTNode<S, I, O>) - Constructor for class de.learnlib.algorithm.adt.model.ReplacementResult
 
ReplacementResult(ADTNode<S, I, O>, ADTNode<S, I, O>, Set<S>) - Constructor for class de.learnlib.algorithm.adt.model.ReplacementResult
 
replaceNode(ADTNode<S, I, O>, ADTNode<S, I, O>) - Method in class de.learnlib.algorithm.adt.adt.ADT
Replaces an existing node in the tree with a new one and updates the references of parent/child nodes accordingly.
reset() - Method in class de.learnlib.algorithm.adt.util.SQOOTBridge
 
RESET_NODE - de.learnlib.algorithm.adt.adt.ADTNode.NodeType
 
resume(ADTLearnerState<ADTState<I, O>, I, O>) - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 

S

secondOutput - Variable in class de.learnlib.algorithm.adt.adt.ADT.LCAInfo
 
setAccessSequence(Word<I>) - Method in class de.learnlib.algorithm.adt.automaton.ADTState
 
setAdtExtender(ADTExtender) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
setAlphabet(Alphabet<I>) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
setHypothesisState(S) - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
setInput(I) - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
setIsSpanningTreeEdge(boolean) - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
setLeafSplitter(LeafSplitter) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
setOracle(SymbolQueryOracle<I, O>) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
setOutput(O) - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
setParent(ADTNode<S, I, O>) - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
setSiftNode(ADTNode<ADTState<I, O>, I, O>) - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
setSource(ADTState<I, O>) - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
setSubtreeReplacer(SubtreeReplacer) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
setSymbol(I) - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
setTarget(ADTState<I, O>) - Method in class de.learnlib.algorithm.adt.automaton.ADTTransition
 
setTransition(ADTState<I, O>, I, ADTTransition<I, O>) - Method in class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 
setTransitionOutput(ADTTransition<I, O>, O) - Method in class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 
setUseObservationTree(boolean) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
sift(SymbolQueryOracle<I, O>, Word<I>) - Method in class de.learnlib.algorithm.adt.adt.ADTLeafNode
 
sift(SymbolQueryOracle<I, O>, Word<I>) - Method in interface de.learnlib.algorithm.adt.adt.ADTNode
Utility method, that sifts a given word through this ADTNode.
sift(SymbolQueryOracle<I, O>, Word<I>) - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
sift(SymbolQueryOracle<I, O>, Word<I>) - Method in class de.learnlib.algorithm.adt.adt.ADTSymbolNode
 
sift(SymbolQueryOracle<I, O>, Word<I>, ADTNode<S, I, O>) - Method in class de.learnlib.algorithm.adt.adt.ADT
Successively sifts a word through the ADT induced by the given node.
SINGLE_BEST_EFFORT - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
SINGLE_MIN_LENGTH - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
SINGLE_MIN_SIZE - Static variable in class de.learnlib.algorithm.adt.config.SubtreeReplacers
 
SingleReplacer - Class in de.learnlib.algorithm.adt.config.model.replacer
 
SingleReplacer(ADSCalculator) - Constructor for class de.learnlib.algorithm.adt.config.model.replacer.SingleReplacer
 
split(ADTNode<S, I, O>, Word<I>, Word<O>, Word<O>) - Method in interface de.learnlib.algorithm.adt.api.LeafSplitter
Split the specified node to correctly distinguish between the old and new hypothesis state.
splitLeaf(ADTNode<S, I, O>, Word<I>, Word<O>, Word<O>, LeafSplitter) - Method in class de.learnlib.algorithm.adt.adt.ADT
Splits a leaf node using a given LeafSplitter.
splitParent(ADTNode<S, I, O>, Word<I>, Word<O>, Word<O>) - Static method in class de.learnlib.algorithm.adt.config.LeafSplitters
 
SQOOTBridge<I,​O> - Class in de.learnlib.algorithm.adt.util
A utility class that links an observation tree with a symbol query oracle, meaning that all queries to the symbol query oracle will be stored in the observation tree.
SQOOTBridge(ObservationTree<?, I, O>, SymbolQueryOracle<I, O>, boolean) - Constructor for class de.learnlib.algorithm.adt.util.SQOOTBridge
 
startLearning() - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
SubtreeReplacer - Interface in de.learnlib.algorithm.adt.api
Interface for configuration objects that specify how nodes of the current ADT should be replaced.
SubtreeReplacers - Class in de.learnlib.algorithm.adt.config
A collection of default SubtreeReplacer configurations.
suspend() - Method in class de.learnlib.algorithm.adt.learner.ADTLearner
 
SYMBOL_NODE - de.learnlib.algorithm.adt.adt.ADTNode.NodeType
 

T

toString() - Method in class de.learnlib.algorithm.adt.adt.ADTResetNode
 
toString() - Method in class de.learnlib.algorithm.adt.adt.ADTSymbolNode
 
trace(S, Word<I>) - Method in class de.learnlib.algorithm.adt.model.ObservationTree
Computes the output of the system under learning when applying the given input sequence in the given hypothesis state.
transformAccessSequence(Word<I>) - Method in class de.learnlib.algorithm.adt.automaton.ADTHypothesis
 

V

valueOf(String) - Static method in enum de.learnlib.algorithm.adt.adt.ADTNode.NodeType
Returns the enum constant of this type with the specified name.
values() - Static method in enum de.learnlib.algorithm.adt.adt.ADTNode.NodeType
Returns an array containing the constants of this enum type, in the order they are declared.

W

withAdtExtender(ADTExtender) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
withAlphabet(Alphabet<I>) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
withLeafSplitter(LeafSplitter) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
withOracle(SymbolQueryOracle<I, O>) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
withSubtreeReplacer(SubtreeReplacer) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
withUseObservationTree(boolean) - Method in class de.learnlib.algorithm.adt.learner.ADTLearnerBuilder
 
A B C D E F G H I L M N O P Q R S T V W 
All Classes All Packages