Module de.learnlib.algorithm.lambda

Package de.learnlib.algorithm.lambda.ttt

Class AbstractTTTLambda<M extends SuffixOutput<I,D>,I,D>

java.lang.Object

de.learnlib.algorithm.lambda.ttt.AbstractTTTLambda<M,I,D>

All Implemented Interfaces:

AccessSequenceTransformer<I>, LearningAlgorithm<M,I,D>, LearnerStateTracker, Resumable<TTTLambdaState<I,D>>, SupportsGrowingAlphabet<I>, FiniteRepresentation

Direct Known Subclasses:

TTTLambdaDFA, TTTLambdaMealy

public abstract class AbstractTTTLambda<M extends SuffixOutput<I,D>,I,D>
extends Object
implements LearningAlgorithm<M,I,D>, AccessSequenceTransformer<I>, SupportsGrowingAlphabet<I>, Resumable<TTTLambdaState<I,D>>, FiniteRepresentation, LearnerStateTracker

Nested Class Summary

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

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

Field Summary

Fields

Modifier and Type	Field	Description
protected final Alphabet<I>	alphabet
protected PrefixTree<I,D>	ptree
protected SuffixTrie<I>	strie

Constructor Summary

Constructors

Modifier	Constructor	Description
protected	AbstractTTTLambda(Alphabet<I> alphabet, MembershipOracle<I,D> mqs, MembershipOracle<I,D> ceqs)

Method Summary

Modifier and Type	Method	Description
void	addAlphabetSymbol(I symbol)
protected abstract AbstractDecisionTree<I,D>	dtree()
protected abstract @Nullable DTLeaf<I,D>	getState(Word<I> prefix)
boolean	hasLearningProcessStarted()	Returns whether the learning process has started yet.
protected void	makeConsistent(MembershipOracle<I,D> oracle)
protected abstract int	maxSearchIndex(int ceLength)
boolean	refineHypothesis(DefaultQuery<I,D> counterexample)	Triggers a refinement of the model by providing a counterexample.
void	resume(TTTLambdaState<I,D> state)	Resume the data structure from a previously suspended point in time.
void	startLearning()	Starts the model inference process, creating an initial hypothesis in the provided model object.
TTTLambdaState<I,D>	suspend()	Expose the state object.
Word<I>	transformAccessSequence(Word<I> word)

Methods inherited from class java.lang.Object

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

Methods inherited from interface de.learnlib.AccessSequenceTransformer

isAccessSequence, longestASPrefix

Methods inherited from interface net.automatalib.automaton.concept.FiniteRepresentation

size

Methods inherited from interface de.learnlib.LearnerStateTracker

requireLearningProcessNotStarted, requireLearningProcessStarted

Methods inherited from interface de.learnlib.algorithm.LearningAlgorithm

getHypothesisModel

Field Details

alphabet

protected final Alphabet<I> alphabet

strie

protected SuffixTrie<I> strie

ptree

protected PrefixTree<I,D> ptree

Constructor Details

AbstractTTTLambda

protected AbstractTTTLambda(Alphabet<I> alphabet,
 MembershipOracle<I,D> mqs,
 MembershipOracle<I,D> ceqs)

Method Details

maxSearchIndex

protected abstract int maxSearchIndex(int ceLength)

getState

protected abstract @Nullable DTLeaf<I,D> getState(Word<I> prefix)

dtree

protected abstract AbstractDecisionTree<I,D> dtree()

startLearning

public void startLearning()

Description copied from interface: LearningAlgorithm

Starts the model inference process, creating an initial hypothesis in the provided model object.

Specified by:

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

refineHypothesis

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

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.

Specified by:

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

Parameters:

counterexample - 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).

hasLearningProcessStarted

public boolean hasLearningProcessStarted()

Description copied from interface: LearnerStateTracker

Returns whether the learning process has started yet.

Specified by:

hasLearningProcessStarted in interface LearnerStateTracker

Returns:

true if the learning process has started, false otherwise

addAlphabetSymbol

public void addAlphabetSymbol(I symbol)

Specified by:

addAlphabetSymbol in interface SupportsGrowingAlphabet<M extends SuffixOutput<I,D>>

transformAccessSequence

public Word<I> transformAccessSequence(Word<I> word)

Specified by:

transformAccessSequence in interface AccessSequenceTransformer<M extends SuffixOutput<I,D>>

makeConsistent

protected void makeConsistent(MembershipOracle<I,D> oracle)

suspend

public TTTLambdaState<I,D> suspend()

Description copied from interface: Resumable

Expose the state object.

Specified by:

suspend in interface Resumable<M extends SuffixOutput<I,D>>

Returns:

The state.

resume

public void resume(TTTLambdaState<I,D> state)

Description copied from interface: Resumable

Resume the data structure from a previously suspended point in time.

Specified by:

resume in interface Resumable<M extends SuffixOutput<I,D>>

Parameters:

state - The learner state.