Uses of Interface
net.automatalib.graph.ads.ADSNode
-
Packages that use ADSNode Package Description net.automatalib.graph.ads net.automatalib.util.automaton.ads -
-
Uses of ADSNode in net.automatalib.graph.ads
Classes in net.automatalib.graph.ads that implement ADSNode Modifier and Type Class 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.Methods in net.automatalib.graph.ads that return types with arguments of type ADSNode Modifier and Type Method Description default Collection<ADSNode<S,I,O>>
ADSNode. getNodes()
Constructors in net.automatalib.graph.ads with parameters of type ADSNode Constructor Description ADSLeafNode(@Nullable ADSNode<S,I,O> parent, S hypothesisState)
ADSSymbolNode(@Nullable ADSNode<S,I,O> parent, I symbol)
-
Uses of ADSNode in net.automatalib.util.automaton.ads
Methods in net.automatalib.util.automaton.ads that return ADSNode Modifier and Type Method Description @Nullable ADSNode<S,I,O>
LYResult. get()
Methods in net.automatalib.util.automaton.ads that return types with arguments of type ADSNode Modifier and Type Method Description static <S,I,T,O>
Pair<ADSNode<S,I,O>,ADSNode<S,I,O>>ADSUtil. buildFromTrace(MealyMachine<S,I,T,O> automaton, Word<I> trace, S state)
static <S,I,T,O>
Pair<ADSNode<S,I,O>,ADSNode<S,I,O>>ADSUtil. buildFromTrace(MealyMachine<S,I,T,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>>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>>StateEquivalence. compute(MealyMachine<S,I,?,O> automaton, Alphabet<I> input, Set<S> states)
Computes a two-state ADS by usingAutomata.findSeparatingWord(UniversalDeterministicAutomaton, UniversalDeterministicAutomaton, Collection)
.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 (dependent on the passed optimization function) ADS.Methods in net.automatalib.util.automaton.ads with parameters of type ADSNode Modifier and Type Method 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>
intADSUtil. computeLength(ADSNode<S,I,O> node)
static <S,I,O>
intADSUtil. countSymbolNodes(ADSNode<S,I,O> node)
static <S,I,O>
OADSUtil. getOutputForSuccessor(ADSNode<S,I,O> node, ADSNode<S,I,O> successor)
-