A
- hypothesis typeI
- input symbol typeD
- output (domain) typepublic abstract class AbstractTestWordEQOracle<A extends net.automatalib.automata.concepts.Output<I,D>,I,D> extends Object implements EquivalenceOracle<A,I,D>
generateTestWords(Output, Collection)
.
Being stream
-based, this oracle encourages the lazy computation of counterexamples, so that all
counterexamples do not have to be computed upfront, but only until the first valid counterexample is found.
EquivalenceOracle.DFAEquivalenceOracle<I>, EquivalenceOracle.MealyEquivalenceOracle<I,O>
Constructor and Description |
---|
AbstractTestWordEQOracle(MembershipOracle<I,D> membershipOracle) |
AbstractTestWordEQOracle(MembershipOracle<I,D> membershipOracle,
int batchSize) |
Modifier and Type | Method and Description |
---|---|
DefaultQuery<I,D> |
findCounterExample(A hypothesis,
Collection<? extends I> inputs)
Searches for a counterexample disproving the subjected hypothesis.
|
protected abstract Stream<net.automatalib.words.Word<I>> |
generateTestWords(A hypothesis,
Collection<? extends I> inputs)
Generate the stream of test words that should be used for the current equivalence check cycle.
|
public AbstractTestWordEQOracle(MembershipOracle<I,D> membershipOracle)
public AbstractTestWordEQOracle(MembershipOracle<I,D> membershipOracle, int batchSize)
@Nullable public DefaultQuery<I,D> findCounterExample(A hypothesis, Collection<? extends I> inputs)
EquivalenceOracle
null
is returned.findCounterExample
in interface EquivalenceOracle<A extends net.automatalib.automata.concepts.Output<I,D>,I,D>
hypothesis
- the conjectureinputs
- the set of inputs to consider, this should be a subset of the input alphabet of the provided hypothesisDefaultQuery
contains the SUL output for the
respective query.protected abstract Stream<net.automatalib.words.Word<I>> generateTestWords(A hypothesis, Collection<? extends I> inputs)
hypothesis
- the current hypothesis of the learning algorithminputs
- the collection of inputs to considerEquivalenceOracle.findCounterExample(Object, Collection)
Copyright © 2018. All rights reserved.