Package | Description |
---|---|
net.automatalib.graphs.ads | |
net.automatalib.graphs.ads.impl | |
net.automatalib.util.automata.ads |
Modifier and Type | Method and Description |
---|---|
default Collection<ADSNode<S,I,O>> |
ADSNode.getNodes() |
Modifier and Type | Class and Description |
---|---|
class |
ADSLeafNode<S,I,O>
An ADS-specific implementation of a leaf node.
|
class |
ADSSymbolNode<S,I,O>
An ADS-specific implementation of a symbol node.
|
Constructor and Description |
---|
ADSLeafNode(ADSNode<S,I,O> parent,
S hypothesisState) |
ADSSymbolNode(ADSNode<S,I,O> parent,
I symbol) |
Modifier and Type | Method and Description |
---|---|
ADSNode<S,I,O> |
LYResult.get() |
Modifier and Type | Method and Description |
---|---|
static <S,I,O> Pair<ADSNode<S,I,O>,ADSNode<S,I,O>> |
ADSUtil.buildFromTrace(MealyMachine<S,I,?,O> automaton,
Word<I> trace,
S state) |
static <S,I,O> Pair<ADSNode<S,I,O>,ADSNode<S,I,O>> |
ADSUtil.buildFromTrace(MealyMachine<S,I,?,O> automaton,
Word<I> trace,
S state) |
static <S,I,O> Set<ADSNode<S,I,O>> |
ADSUtil.collectLeaves(ADSNode<S,I,O> root) |
static <S,I,O> Optional<ADSNode<S,I,O>> |
ADS.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Compute an adaptive distinguishing sequence for the given automaton and the given set of states.
|
static <S,I,O> Optional<ADSNode<S,I,O>> |
StateEquivalence.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Computes a two-state ADS by using
Automata.findSeparatingWord(UniversalDeterministicAutomaton,
UniversalDeterministicAutomaton, Collection) . |
static <S,I,O> Optional<ADSNode<S,I,O>> |
BacktrackingSearch.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Computes an ADS by constructing (growing) splitting words for the current set of states and recursively computing
sub-ADSs for the induced partitions.
|
static <S,I,O> Optional<ADSNode<S,I,O>> |
BacktrackingSearch.computeOptimal(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states,
BacktrackingSearch.CostAggregator costAggregator)
Computes an ADS by iterating over the successor tree in a breadth-first manner, yielding an optimal (dependant on
the passed optimization function) ADS.
|
Modifier and Type | Method and Description |
---|---|
static <S,I,O> Pair<Word<I>,Word<O>> |
ADSUtil.buildTraceForNode(ADSNode<S,I,O> node) |
static <S,I,O> Set<ADSNode<S,I,O>> |
ADSUtil.collectLeaves(ADSNode<S,I,O> root) |
static <S,I,O> int |
ADSUtil.computeLength(ADSNode<S,I,O> node) |
static <S,I,O> int |
ADSUtil.countSymbolNodes(ADSNode<S,I,O> node) |
static <S,I,O> O |
ADSUtil.getOutputForSuccessor(ADSNode<S,I,O> node,
ADSNode<S,I,O> successor) |
static <S,I,O> O |
ADSUtil.getOutputForSuccessor(ADSNode<S,I,O> node,
ADSNode<S,I,O> successor) |
Constructor and Description |
---|
LYResult(ADSNode<S,I,O> result) |
Copyright © 2018. All rights reserved.