Package de.learnlib.algorithm.oml.lstar

Class OptimalLStarDFA<I>

java.lang.Object

de.learnlib.algorithm.oml.lstar.OptimalLStarDFA<I>

All Implemented Interfaces:

LearningAlgorithm<DFA<?,I>,I,Boolean>, LearningAlgorithm.DFALearner<I>, Resumable<OptimalLStarState<I,Boolean>>, FiniteRepresentation, InputAlphabetHolder<I>

public class OptimalLStarDFA<I>
extends Object
implements LearningAlgorithm.DFALearner<I>

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>

Constructor Summary

Constructors

Constructor	Description
OptimalLStarDFA(Alphabet<I> sigma, MembershipOracle<I,Boolean> mqo)
OptimalLStarDFA(Alphabet<I> sigma, MembershipOracle<I,Boolean> mqs, MembershipOracle<I,Boolean> ceqs)

Method Summary

Modifier and Type	Method	Description
DFA<?,I>	getHypothesisModel()	Returns the current hypothesis model.
Alphabet<I>	getInputAlphabet()
Boolean	getOutput(Word<I> input, int length)
boolean	refineHypothesis(DefaultQuery<I,D> counterexample)	Triggers a refinement of the model by providing a counterexample.
void	resume(OptimalLStarState<I,D> state)	Resume the datastructure from a previously suspended point in time.
List<Boolean>	rowForState(Word<I> input)
int	size()
void	startLearning()	Starts the model inference process, creating an initial hypothesis in the provided model object.
OptimalLStarState<I,D>	suspend()	Expose the state object.

Methods inherited from class java.lang.Object

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

Methods inherited from interface de.learnlib.algorithm.LearningAlgorithm

refineHypothesis, startLearning

Constructor Detail

OptimalLStarDFA

public OptimalLStarDFA(Alphabet<I> sigma,
                       MembershipOracle<I,Boolean> mqo)

OptimalLStarDFA

public OptimalLStarDFA(Alphabet<I> sigma,
                       MembershipOracle<I,Boolean> mqs,
                       MembershipOracle<I,Boolean> ceqs)

Method Detail

size

public int size()

Specified by:

size in interface FiniteRepresentation

rowForState

public List<Boolean> rowForState(Word<I> input)

getOutput

public Boolean getOutput(Word<I> input,
                         int length)

getHypothesisModel

public DFA<?,I> getHypothesisModel()

Description copied from interface: LearningAlgorithm

Returns the current hypothesis model.

N.B.: By the contract of this interface, the model returned by this method may not be modified (i.e., M generally should refer to an immutable interface), and its validity is retained only until the next invocation of LearningAlgorithm.refineHypothesis(DefaultQuery). If older hypotheses have to be maintained, a copy of the returned model must be made.

Please note that it should be illegal to invoke this method before an initial invocation of LearningAlgorithm.startLearning().

Specified by:

getHypothesisModel in interface LearningAlgorithm<DFA<?,I>,I,Boolean>

Returns:

the current hypothesis model.

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,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. Please note that invoking this method before an initial invocation of LearningAlgorithm.startLearning() should be illegal.

Specified by:

refineHypothesis in interface LearningAlgorithm<M,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).

getInputAlphabet

public Alphabet<I> getInputAlphabet()

Specified by:

getInputAlphabet in interface InputAlphabetHolder<M>

suspend

public OptimalLStarState<I,D> suspend()

Description copied from interface: Resumable

Expose the state object.

Specified by:

suspend in interface Resumable<M>

Returns:

The state.

resume

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

Description copied from interface: Resumable

Resume the datastructure from a previously suspended point in time.

Specified by:

resume in interface Resumable<M>

Parameters:

state - The learner state.