de.learnlib.algorithms.ttt.dfa

Class PrefixTTTLearnerDFA<I>

java.lang.Object

de.learnlib.algorithms.ttt.base.AbstractTTTLearner<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean>

de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA<I>

de.learnlib.algorithms.ttt.dfa.PrefixTTTLearnerDFA<I>

All Implemented Interfaces:

ResumableLearner<TTTLearnerState<I,Boolean>>, SupportsGrowingAlphabet<I>, LearningAlgorithm<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean>, LearningAlgorithm.DFALearner<I>

public class PrefixTTTLearnerDFA<I>
extends TTTLearnerDFA<I>

Author:

Malte Isberner

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
protected static class	PrefixTTTLearnerDFA.ExtDTNode<I>

Nested classes/interfaces inherited from class de.learnlib.algorithms.ttt.base.AbstractTTTLearner

AbstractTTTLearner.BuilderDefaults, AbstractTTTLearner.Splitter<I,D>

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

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

Field Summary

Fields inherited from class de.learnlib.algorithms.ttt.base.AbstractTTTLearner

alphabet, analyzer, blockList, dtree, hypothesis, openTransitions, oracle

Constructor Summary

Constructors

Constructor and Description
PrefixTTTLearnerDFA(net.automatalib.words.Alphabet<I> alphabet, MembershipOracle<I,Boolean> oracle, AcexAnalyzer analyzer)

Method Summary

Modifier and Type	Method and Description
protected TTTState<I,Boolean>	makeTree(TTTTransition<I,Boolean> trans)
boolean	refineHypothesis(DefaultQuery<I,Boolean> ceQuery)
protected boolean	refineHypothesisSingle(DefaultQuery<I,Boolean> ceQuery) Performs a single refinement of the hypothesis, i.e., without repeated counterexample evaluation.

Methods inherited from class de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA

computeHypothesisOutput, createNewNode, deriveAcex, getHypothesisDS, getHypothesisModel, initializeState, predictSuccOutcome, succEffect

Methods inherited from class de.learnlib.algorithms.ttt.base.AbstractTTTLearner

addAlphabetSymbol, addEventListener, allNodesFinal, closeTransitions, createMap, createTransition, declareFinal, finalizeAny, findOutputInconsistency, getAnySuccessor, getAnySuccessor, getAnyTarget, getDeterministicState, getDiscriminationTree, getNondetSuccessors, getStateTransition, link, query, query, removeEventListener, resume, split, startLearning, suspend

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.algorithm.LearningAlgorithm

startLearning

Constructor Detail

PrefixTTTLearnerDFA

public PrefixTTTLearnerDFA(net.automatalib.words.Alphabet<I> alphabet,
                           MembershipOracle<I,Boolean> oracle,
                           AcexAnalyzer analyzer)

Method Detail

refineHypothesis

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

Specified by:

refineHypothesis in interface LearningAlgorithm<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean>

Overrides:

refineHypothesis in class AbstractTTTLearner<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean>

refineHypothesisSingle

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

Description copied from class: AbstractTTTLearner

Performs a single refinement of the hypothesis, i.e., without repeated counterexample evaluation. The parameter and return value have the same significance as in AbstractTTTLearner.refineHypothesis(DefaultQuery).

Overrides:

refineHypothesisSingle in class AbstractTTTLearner<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean>

Parameters:

ceQuery - the counterexample (query) to be used for refinement

Returns:

true if the hypothesis was refined, false otherwise

makeTree

protected TTTState<I,Boolean> makeTree(TTTTransition<I,Boolean> trans)

Overrides:

makeTree in class AbstractTTTLearner<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean>