S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet type@ParametersAreNonnullByDefault public final class DefensiveADS<S,I,O> extends Object
ADS
, BacktrackingSearch
), that works on partially defined automata. It tries to find an
ADS based on defined transitions and successively closes transitions if no ADS has been found.Modifier and Type | Method and Description |
---|---|
static <S,I,O> Optional<ADTNode<S,I,O>> |
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.
|
public static <S,I,O> Optional<ADTNode<S,I,O>> compute(net.automatalib.automata.transout.MealyMachine<S,I,?,O> automaton, net.automatalib.words.Alphabet<I> alphabet, Set<S> states, PartialTransitionAnalyzer<S,I> pta)
S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet typeautomaton
- the automaton for which an ADS should be computedalphabet
- the input alphabet of the automatonstates
- the set of states which should be distinguished by the computed ADSpta
- the analyzer to inspect and close partial transitionsOptional.empty()
if there exists no ADS that distinguishes the given states, a valid ADS
otherwise.Copyright © 2018. All rights reserved.