de.learnlib.algorithms.adt.learner

Class ADTLearner<I,O>

java.lang.Object

de.learnlib.algorithms.adt.learner.ADTLearner<I,O>

Type Parameters:

I - input alphabet type

O - output alphabet type

All Implemented Interfaces:

PartialTransitionAnalyzer<ADTState<I,O>,I>, LearningAlgorithm<MealyMachine<?,I,?,O>,I,Word<O>>, LearningAlgorithm.MealyLearner<I,O>, Resumable<ADTLearnerState<ADTState<I,O>,I,O>>, SupportsGrowingAlphabet<I>

public class ADTLearner<I,O>
extends Object
implements LearningAlgorithm.MealyLearner<I,O>, PartialTransitionAnalyzer<ADTState<I,O>,I>, SupportsGrowingAlphabet<I>, Resumable<ADTLearnerState<ADTState<I,O>,I,O>>

The main learning algorithm.

Author:

frohme

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	ADTLearner.BuilderDefaults

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

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

Nested classes/interfaces inherited from interface de.learnlib.algorithms.adt.api.PartialTransitionAnalyzer

PartialTransitionAnalyzer.HypothesisModificationException

Field Summary

Fields inherited from interface de.learnlib.algorithms.adt.api.PartialTransitionAnalyzer

HYPOTHESIS_MODIFICATION_EXCEPTION

Constructor Summary

Constructors

Constructor and Description
ADTLearner(Alphabet<I> alphabet, SymbolQueryOracle<I,O> oracle, LeafSplitter leafSplitter, ADTExtender adtExtender, SubtreeReplacer subtreeReplacer)
ADTLearner(Alphabet<I> alphabet, SymbolQueryOracle<I,O> oracle, LeafSplitter leafSplitter, ADTExtender adtExtender, SubtreeReplacer subtreeReplacer, boolean useObservationTree)

Method Summary

Modifier and Type	Method and Description
void	addAlphabetSymbol(I symbol)
void	closeTransition(ADTState<I,O> state, I input) Determine the successor/output of the transition in question (which is usually achieved by sifting the corresponding long-prefix through the ADT).
ADT<ADTState<I,O>,I,O>	getADT()
MealyMachine<?,I,?,O>	getHypothesisModel()
boolean	isTransitionDefined(ADTState<I,O> state, I input) Check whether the transition in question is defined or not.
boolean	refineHypothesis(DefaultQuery<I,Word<O>> ce)
boolean	refineHypothesisInternal(DefaultQuery<I,Word<O>> ceQuery)
void	resume(ADTLearnerState<ADTState<I,O>,I,O> state)
void	startLearning()
ADTLearnerState<ADTState<I,O>,I,O>	suspend()

Methods inherited from class java.lang.Object

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

Constructor Detail

ADTLearner

public ADTLearner(Alphabet<I> alphabet,
                  SymbolQueryOracle<I,O> oracle,
                  LeafSplitter leafSplitter,
                  ADTExtender adtExtender,
                  SubtreeReplacer subtreeReplacer)

ADTLearner

public ADTLearner(Alphabet<I> alphabet,
                  SymbolQueryOracle<I,O> oracle,
                  LeafSplitter leafSplitter,
                  ADTExtender adtExtender,
                  SubtreeReplacer subtreeReplacer,
                  boolean useObservationTree)

Method Detail

startLearning

public void startLearning()

Specified by:

startLearning in interface LearningAlgorithm<MealyMachine<?,I,?,O>,I,Word<O>>

refineHypothesis

public boolean refineHypothesis(DefaultQuery<I,Word<O>> ce)

Specified by:

refineHypothesis in interface LearningAlgorithm<MealyMachine<?,I,?,O>,I,Word<O>>

refineHypothesisInternal

public boolean refineHypothesisInternal(DefaultQuery<I,Word<O>> ceQuery)

getHypothesisModel

public MealyMachine<?,I,?,O> getHypothesisModel()

Specified by:

getHypothesisModel in interface LearningAlgorithm<MealyMachine<?,I,?,O>,I,Word<O>>

closeTransition

public void closeTransition(ADTState<I,O> state,
                            I input)

Description copied from interface: PartialTransitionAnalyzer

Determine the successor/output of the transition in question (which is usually achieved by sifting the corresponding long-prefix through the ADT).

Specified by:

closeTransition in interface PartialTransitionAnalyzer<ADTState<I,O>,I>

Parameters:

state - the (source) state of the transition in question

input - the input symbol of the transition in question

isTransitionDefined

public boolean isTransitionDefined(ADTState<I,O> state,
                                   I input)

Description copied from interface: PartialTransitionAnalyzer

Check whether the transition in question is defined or not.

Specified by:

isTransitionDefined in interface PartialTransitionAnalyzer<ADTState<I,O>,I>

Parameters:

state - the (source) state of the transition in question

input - the input symbol of the transition in question

Returns:

true if the transition (and thus the successor/output) is defined, false otherwise

addAlphabetSymbol

public void addAlphabetSymbol(I symbol)

Specified by:

addAlphabetSymbol in interface SupportsGrowingAlphabet<I>

suspend

public ADTLearnerState<ADTState<I,O>,I,O> suspend()

Specified by:

suspend in interface Resumable<ADTLearnerState<ADTState<I,O>,I,O>>

resume

public void resume(ADTLearnerState<ADTState<I,O>,I,O> state)

Specified by:

resume in interface Resumable<ADTLearnerState<ADTState<I,O>,I,O>>

getADT

public ADT<ADTState<I,O>,I,O> getADT()