de.learnlib.algorithms.discriminationtree

Class AbstractDTLearner<M extends SuffixOutput<I,D>,I,D,SP,TP>

java.lang.Object

de.learnlib.algorithms.discriminationtree.AbstractDTLearner<M,I,D,SP,TP>

All Implemented Interfaces:

LearningAlgorithm<M,I,D>

Direct Known Subclasses:

DTLearnerDFA, DTLearnerMealy

public abstract class AbstractDTLearner<M extends SuffixOutput<I,D>,I,D,SP,TP>
extends Object
implements LearningAlgorithm<M,I,D>

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	AbstractDTLearner.BuilderDefaults

Nested classes/interfaces inherited from interface de.learnlib.api.LearningAlgorithm

LearningAlgorithm.DFALearner<I>, LearningAlgorithm.MealyLearner<I,O>

Field Summary

Fields

Modifier and Type	Field and Description
protected DiscriminationTree<I,D,HState<I,D,SP,TP>>	dtree
protected DTLearnerHypothesis<I,D,SP,TP>	hypothesis

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	AbstractDTLearner(Alphabet<I> alphabet, MembershipOracle<I,D> oracle, LocalSuffixFinder<? super I,? super D> suffixFinder, boolean repeatedCounterexampleEvaluation, DiscriminationTree<I,D,HState<I,D,SP,TP>> dtree)

Method Summary

Modifier and Type	Method and Description
protected HState<I,D,SP,TP>	createState(HTransition<I,D,SP,TP> trans)
DiscriminationTree.GraphView	dtGraphView()
DiscriminationTree<I,D,HState<I,D,SP,TP>>	getDiscriminationTree()
GraphDOTHelper<HState<I,D,SP,TP>,HTransition<I,D,SP,TP>>	getHypothesisDOTHelper()
DTLearnerHypothesis<I,D,SP,TP>	getHypothesisDS()
protected void	initializeState(HState<I,D,SP,TP> newState)
boolean	refineHypothesis(DefaultQuery<I,D> ceQuery) Triggers a refinement of the model by providing a counterexample.
protected boolean	refineHypothesisSingle(DefaultQuery<I,D> ceQuery)
protected abstract Query<I,D>	spQuery(HState<I,D,SP,TP> state)
void	startLearning() Starts the model inference process, creating an initial hypothesis in the provided model object.
protected abstract Query<I,D>	tpQuery(HTransition<I,D,SP,TP> transition)
protected void	updateHypothesis()
protected void	updateTransition(HTransition<I,D,SP,TP> trans)

Methods inherited from class java.lang.Object

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

Methods inherited from interface de.learnlib.api.LearningAlgorithm

getHypothesisModel

Field Detail

dtree

protected final DiscriminationTree<I,D,HState<I,D,SP,TP>> dtree

hypothesis

protected final DTLearnerHypothesis<I,D,SP,TP> hypothesis

Constructor Detail

AbstractDTLearner

protected AbstractDTLearner(Alphabet<I> alphabet,
                            MembershipOracle<I,D> oracle,
                            LocalSuffixFinder<? super I,? super D> suffixFinder,
                            boolean repeatedCounterexampleEvaluation,
                            DiscriminationTree<I,D,HState<I,D,SP,TP>> dtree)

Method Detail

refineHypothesis

public boolean refineHypothesis(DefaultQuery<I,D> ceQuery)

Description copied from interface: LearningAlgorithm

Triggers a refinement of the model by providing a counterexample. A counterexample is a query which exposes different behavior of the real SUL compared to the hypothesis. Please note that invoking this method before an initial invocation of LearningAlgorithm.startLearning() should be illegal.

Specified by:

refineHypothesis in interface LearningAlgorithm<M extends SuffixOutput<I,D>,I,D>

Parameters:

ceQuery - the query which exposes diverging behavior, as posed to the real SUL (i.e. with the SULs output).

Returns:

true if the counterexample triggered a refinement of the hypothesis, false otherwise (i.e., it was no counterexample).

startLearning

public void startLearning()

Description copied from interface: LearningAlgorithm

Starts the model inference process, creating an initial hypothesis in the provided model object. Please note that it should be illegal to invoke this method twice.

Specified by:

startLearning in interface LearningAlgorithm<M extends SuffixOutput<I,D>,I,D>

getDiscriminationTree

public DiscriminationTree<I,D,HState<I,D,SP,TP>> getDiscriminationTree()

getHypothesisDS

public DTLearnerHypothesis<I,D,SP,TP> getHypothesisDS()

getHypothesisDOTHelper

public GraphDOTHelper<HState<I,D,SP,TP>,HTransition<I,D,SP,TP>> getHypothesisDOTHelper()

refineHypothesisSingle

protected boolean refineHypothesisSingle(DefaultQuery<I,D> ceQuery)

initializeState

protected void initializeState(HState<I,D,SP,TP> newState)

createState

protected HState<I,D,SP,TP> createState(HTransition<I,D,SP,TP> trans)

updateTransition

protected void updateTransition(HTransition<I,D,SP,TP> trans)

updateHypothesis

protected void updateHypothesis()

spQuery

protected abstract Query<I,D> spQuery(HState<I,D,SP,TP> state)

tpQuery

protected abstract Query<I,D> tpQuery(HTransition<I,D,SP,TP> transition)

dtGraphView

public DiscriminationTree.GraphView dtGraphView()