public final class ADS extends Object
LeeYannakakis, BacktrackingSearch (non-optimal) and StateEquivalence for the actual computation of the ADS.| Modifier and Type | Method and Description |
|---|---|
static <S,I,O> Optional<ADSNode<S,I,O>> |
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.
|
public static <S,I,O> Optional<ADSNode<S,I,O>> compute(MealyMachine<S,I,?,O> automaton, Alphabet<I> input, Set<S> states)
S - (hypothesis) state typeI - input alphabet typeO - output alphabet typeautomaton - the automaton for which an ADS should be computedinput - the input alphabet of the automatonstates - the set of states which should be distinguished by the computed ADSOptional.empty() if there exists no ADS that distinguishes the given states, a valid ADS
otherwise.Copyright © 2018. All rights reserved.