public final class ADTUtil extends Object
Modifier and Type | Method and Description |
---|---|
static <S,I,O> ADTNode<S,I,O> |
buildADSFromObservation(net.automatalib.words.Word<I> input,
net.automatalib.words.Word<O> output,
S finalState)
Build a single trace ADS from the given information.
|
static <S,I,O> net.automatalib.commons.util.Pair<ADTNode<S,I,O>,ADTNode<S,I,O>> |
buildADSFromTrace(net.automatalib.automata.transout.MealyMachine<S,I,?,O> automaton,
net.automatalib.words.Word<I> trace,
S state) |
static <S,I,O> ADTNode<S,I,O> |
buildFromADS(net.automatalib.graphs.ads.ADSNode<S,I,O> node)
Utility method that wraps a ADS of type
ADSNode into the equivalent ADS of type ADTNode . |
static <S,I,O> net.automatalib.commons.util.Pair<net.automatalib.words.Word<I>,net.automatalib.words.Word<O>> |
buildTraceForNode(ADTNode<S,I,O> node) |
static <S,I,O> Set<ADTNode<S,I,O>> |
collectADSNodes(ADTNode<S,I,O> root) |
static <S,I,O> Set<ADTNode<S,I,O>> |
collectDirectSubADSs(ADTNode<S,I,O> node) |
static <S,I,O> Set<ADTNode<S,I,O>> |
collectLeaves(ADTNode<S,I,O> root) |
static <S,I,O> Set<ADTNode<S,I,O>> |
collectResetNodes(ADTNode<S,I,O> root) |
static <S,I,O> int |
computeEffectiveResets(ADTNode<S,I,O> adt)
Computes how often reset nodes are encountered when traversing from the given node to the leaves of the induced
subtree of the given node.
|
static <S,I,O> O |
getOutputForSuccessor(ADTNode<S,I,O> node,
ADTNode<S,I,O> successor) |
static <S,I,O> ADTNode<S,I,O> |
getStartOfADS(ADTNode<S,I,O> node) |
static <S,I,O> boolean |
isLeafNode(ADTNode<S,I,O> node) |
static <S,I,O> boolean |
isResetNode(ADTNode<S,I,O> node) |
static <S,I,O> boolean |
isSymbolNode(ADTNode<S,I,O> node) |
static <S,I,O> boolean |
mergeADS(ADTNode<S,I,O> parent,
ADTNode<S,I,O> child)
Tries to merge the given (single trace) ADSs (which only contains one leaf) into the given parent ADSs.
|
public static <S,I,O> boolean isSymbolNode(ADTNode<S,I,O> node)
public static <S,I,O> boolean isResetNode(ADTNode<S,I,O> node)
public static <S,I,O> Set<ADTNode<S,I,O>> collectDirectSubADSs(ADTNode<S,I,O> node)
public static <S,I,O> net.automatalib.commons.util.Pair<net.automatalib.words.Word<I>,net.automatalib.words.Word<O>> buildTraceForNode(ADTNode<S,I,O> node)
public static <S,I,O> O getOutputForSuccessor(ADTNode<S,I,O> node, ADTNode<S,I,O> successor)
public static <S,I,O> ADTNode<S,I,O> buildFromADS(net.automatalib.graphs.ads.ADSNode<S,I,O> node)
ADSNode
into the equivalent ADS of type ADTNode
.S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet typenode
- the root node of the ADSADTNode
interfacepublic static <S,I,O> int computeEffectiveResets(ADTNode<S,I,O> adt)
S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet typeadt
- the node whose subtree should be analyzedpublic static <S,I,O> net.automatalib.commons.util.Pair<ADTNode<S,I,O>,ADTNode<S,I,O>> buildADSFromTrace(net.automatalib.automata.transout.MealyMachine<S,I,?,O> automaton, net.automatalib.words.Word<I> trace, S state)
public static <S,I,O> ADTNode<S,I,O> buildADSFromObservation(net.automatalib.words.Word<I> input, net.automatalib.words.Word<O> output, S finalState)
S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet typeinput
- the input sequence of the traceoutput
- the output sequence of the tracefinalState
- the hypothesis state that should be referenced in the leaf of the ADSpublic static <S,I,O> boolean mergeADS(ADTNode<S,I,O> parent, ADTNode<S,I,O> child)
S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet typeparent
- the parent ADS in which the given child ADS should be merged intochild
- the (single trace) ADS which should be incorporated into the parent ADS.true
if ADSs could be merged, false
otherwisepublic static <S,I,O> boolean isLeafNode(ADTNode<S,I,O> node)
Copyright © 2018. All rights reserved.