net.automatalib.util.automata.ads

Class StateEquivalence

java.lang.Object

net.automatalib.util.automata.ads.StateEquivalence

public final class StateEquivalence
extends Object

A utility class for computing an adaptive distinguishing sequence by means of solving the state equivalence problems, i.e. computing and ADS for two states only.

Author:

frohme

Method Summary

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) Computes a two-state ADS by using Automata.findSeparatingWord(UniversalDeterministicAutomaton, UniversalDeterministicAutomaton, Collection).

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

compute

public static <S,I,O> Optional<ADSNode<S,I,O>> compute(MealyMachine<S,I,?,O> automaton,
                                                       Alphabet<I> input,
                                                       Set<S> states)
                                                throws IllegalArgumentException

Computes a two-state ADS by using Automata.findSeparatingWord(UniversalDeterministicAutomaton, UniversalDeterministicAutomaton, Collection).

Type Parameters:

S - (hypothesis) state type

I - input alphabet type

O - output alphabet type

Parameters:

automaton - the automaton for which an ADS should be computed

input - the input alphabet of the automaton

states - the set of states which should be distinguished by the computed ADS

Returns:

Optional.empty() if there exists no ADS that distinguishes the given states, a valid ADS otherwise.

Throws:

IllegalArgumentException - if passed anything other than two states.