Modifier and Type | Method and Description |
---|---|
static <S,I,O> Optional<ADTNode<S,I,O>> |
DefensiveADS.compute(net.automatalib.automata.transout.MealyMachine<S,I,?,O> automaton,
net.automatalib.words.Alphabet<I> alphabet,
Set<S> states,
PartialTransitionAnalyzer<S,I> pta)
Compute an adaptive distinguishing sequence (as an ADT) for the given automaton and the given set of states.
|
Modifier and Type | Method and Description |
---|---|
<I,O> ExtensionResult<ADTState<I,O>,I,O> |
ADTExtender.computeExtension(ADTHypothesis<I,O> hypothesis,
PartialTransitionAnalyzer<ADTState<I,O>,I> pta,
ADTNode<ADTState<I,O>,I,O> temporarySplitter)
Compute the ADT whose root node should replace the root of the temporary splitter in the current ADT.
|
Modifier and Type | Method and Description |
---|---|
<S,I,O> Optional<ADTNode<S,I,O>> |
DefensiveADSCalculator.compute(net.automatalib.automata.transout.MealyMachine<S,I,?,O> automaton,
net.automatalib.words.Alphabet<I> alphabet,
Set<S> states,
PartialTransitionAnalyzer<S,I> partialTransitionAnalyzer) |
Modifier and Type | Method and Description |
---|---|
<S,I,O> Optional<ADTNode<S,I,O>> |
BestEffortDefensiveCalculator.compute(net.automatalib.automata.transout.MealyMachine<S,I,?,O> automaton,
net.automatalib.words.Alphabet<I> alphabet,
Set<S> states,
PartialTransitionAnalyzer<S,I> partialTransitionAnalyzer) |
Modifier and Type | Method and Description |
---|---|
<I,O> ExtensionResult<ADTState<I,O>,I,O> |
DefaultExtender.computeExtension(ADTHypothesis<I,O> hypothesis,
PartialTransitionAnalyzer<ADTState<I,O>,I> partialTransitionAnalyzer,
ADTNode<ADTState<I,O>,I,O> ads) |
Modifier and Type | Class and Description |
---|---|
class |
ADTLearner<I,O>
The main learning algorithm.
|
Copyright © 2018. All rights reserved.