public final class ADSUtil extends Object
Modifier and Type | Method and Description |
---|---|
static <S,I,T,O> Pair<ADSNode<S,I,O>,ADSNode<S,I,O>> |
buildFromTrace(MealyMachine<S,I,T,O> automaton,
Word<I> trace,
S state) |
static <S,I,O> Pair<Word<I>,Word<O>> |
buildTraceForNode(ADSNode<S,I,O> node) |
static <S,I,O> Set<ADSNode<S,I,O>> |
collectLeaves(ADSNode<S,I,O> root) |
static <S,I,O> int |
computeLength(ADSNode<S,I,O> node) |
static long |
computeMaximumSplittingWordLength(int n,
int i,
int m)
Computes an upper bound for the length of a splitting word.
|
static <S,I,O> int |
countSymbolNodes(ADSNode<S,I,O> node) |
static <S,I,O> O |
getOutputForSuccessor(ADSNode<S,I,O> node,
ADSNode<S,I,O> successor) |
public static <S,I,O> int computeLength(ADSNode<S,I,O> node)
public static <S,I,O> int countSymbolNodes(ADSNode<S,I,O> node)
public static <S,I,T,O> Pair<ADSNode<S,I,O>,ADSNode<S,I,O>> buildFromTrace(MealyMachine<S,I,T,O> automaton, Word<I> trace, S state)
public static <S,I,O> Pair<Word<I>,Word<O>> buildTraceForNode(ADSNode<S,I,O> node)
public static <S,I,O> O getOutputForSuccessor(ADSNode<S,I,O> node, ADSNode<S,I,O> successor)
public static long computeMaximumSplittingWordLength(int n, int i, int m)
I.V. Kogan. "Estimated Length of a Minimal Simple Conditional Diagnostic Experiment". In: Automation and Remote Control 34 (1973)
n
- the size of the automaton (number of states)i
- the number of states that should be distinguished by the current splitting wordm
- the number of states that should originally be distinguishedCopyright © 2020. All rights reserved.