de.learnlib.counterexamples

Class LocalSuffixFinders

java.lang.Object

de.learnlib.counterexamples.LocalSuffixFinders

public abstract class LocalSuffixFinders
extends Object

A collection of suffix-based local counterexample analyzers.

Author:

Malte Isberner

See Also:

LocalSuffixFinder

Field Summary

Fields

Modifier and Type	Field and Description
static LocalSuffixFinder<Object,Object>	FIND_LINEAR Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear ascending order.
static LocalSuffixFinder<Object,Object>	FIND_LINEAR_REVERSE Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear descending order.
static LocalSuffixFinder<Object,Object>	RIVEST_SCHAPIRE Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations using a binary search, as proposed by Rivest & Schapire.

Method Summary

Modifier and Type	Method and Description
static <S,I,D> int	findLinear(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle) Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear ascending order.
static <I,D> int	findLinearReverse(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle) Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear descending order.
static <I,D> int	findRivestSchapire(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle) Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations using a binary search, as proposed by Rivest & Schapire.
static LocalSuffixFinder<Object,Object>[]	values()

Methods inherited from class java.lang.Object

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

Field Detail

FIND_LINEAR

public static final LocalSuffixFinder<Object,Object> FIND_LINEAR

Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear ascending order.

See Also:

findLinear(Query, AccessSequenceTransformer, SuffixOutput, MembershipOracle)

FIND_LINEAR_REVERSE

public static final LocalSuffixFinder<Object,Object> FIND_LINEAR_REVERSE

Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear descending order.

See Also:

findLinearReverse(Query, AccessSequenceTransformer, SuffixOutput, MembershipOracle)

RIVEST_SCHAPIRE

public static final LocalSuffixFinder<Object,Object> RIVEST_SCHAPIRE

Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations using a binary search, as proposed by Rivest & Schapire.

See Also:

findRivestSchapire(Query, AccessSequenceTransformer, SuffixOutput, MembershipOracle)

Method Detail

findLinear

public static <S,I,D> int findLinear(Query<I,D> ceQuery,
                                     AccessSequenceTransformer<I> asTransformer,
                                     SuffixOutput<I,D> hypOutput,
                                     MembershipOracle<I,D> oracle)

Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear ascending order.

Parameters:

ceQuery - the initial counterexample query

asTransformer - the access sequence transformer

hypOutput - interface to the hypothesis output, for checking whether the oracle output contradicts the hypothesis

oracle - interface to the SUL

Returns:

the index of the respective suffix, or -1 if no counterexample could be found

See Also:

LocalSuffixFinder

findLinearReverse

public static <I,D> int findLinearReverse(Query<I,D> ceQuery,
                                          AccessSequenceTransformer<I> asTransformer,
                                          SuffixOutput<I,D> hypOutput,
                                          MembershipOracle<I,D> oracle)

Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear descending order.

Parameters:

ceQuery - the initial counterexample query

asTransformer - the access sequence transformer

hypOutput - interface to the hypothesis output, for checking whether the oracle output contradicts the hypothesis

oracle - interface to the SUL

Returns:

the index of the respective suffix, or -1 if no counterexample could be found

See Also:

LocalSuffixFinder

findRivestSchapire

public static <I,D> int findRivestSchapire(Query<I,D> ceQuery,
                                           AccessSequenceTransformer<I> asTransformer,
                                           SuffixOutput<I,D> hypOutput,
                                           MembershipOracle<I,D> oracle)

Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations using a binary search, as proposed by Rivest & Schapire.

Parameters:

ceQuery - the initial counterexample query

asTransformer - the access sequence transformer

hypOutput - interface to the hypothesis output, for checking whether the oracle output contradicts the hypothesis

oracle - interface to the SUL

Returns:

the index of the respective suffix, or -1 if no counterexample could be found

See Also:

LocalSuffixFinder

values

public static LocalSuffixFinder<Object,Object>[] values()