public final class LeeYannakakis extends Object
See: D. Lee and M. Yannakakis - "Testing Finite-State Machines: State Identification and Verification", IEEE Transactions on Computers 43.3 (1994)
Modifier and Type | Method and Description |
---|---|
static <S,I,O> LYResult<S,I,O> |
compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input)
Computes an ADS using the algorithm of Lee and Yannakakis.
|
public static <S,I,O> LYResult<S,I,O> compute(MealyMachine<S,I,?,O> automaton, Alphabet<I> input)
S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet typeautomaton
- The automaton for which an ADS should be computedinput
- the input alphabet of the automatonLYResult
containing an adaptive distinguishing sequence (if existent) and a possible set of
indistinguishable states.Copyright © 2018. All rights reserved.