Uses of Interface de.learnlib.acex.AbstractCounterexample (LearnLib 0.18.0 API)

Packages that use AbstractCounterexample
Package	Description
de.learnlib.acex	This package provides interfaces and classes for the abstract counterexample analysis framework described in the paper An Abstract Framework for Counterexample Analysis in Active Automata Learning by Malte Isberner and Bernhard Steffen.
de.learnlib.algorithm.kv.dfa
de.learnlib.algorithm.kv.mealy
de.learnlib.algorithm.observationpack.vpa

Classes in de.learnlib.acex that implement AbstractCounterexample
Modifier and Type	Class	Description
`class`	`AbstractBaseCounterexample<E>`
`class`	`ClassicPrefixTransformAcex<I,D>`	An abstract counterexample based on prefix transformations.
`class`	`MealyOutInconsPrefixTransformAcex<I,O>`
`class`	`MooreOutInconsPrefixTransformAcex<I,O>`
`class`	`OutInconsPrefixTransformAcex<I,D>`	An abstract counterexample for output inconsistencies, based on prefix transformations.

Methods in de.learnlib.acex with parameters of type AbstractCounterexample
Modifier and Type	Method	Description
`default int`	AcexAnalyzer.`analyzeAbstractCounterexample(AbstractCounterexample<?> acex)`	Analyzes an abstract counterexample.
`default int`	AcexAnalyzer.`analyzeAbstractCounterexample(AbstractCounterexample<?> acex, int low)`
`int`	AcexAnalyzer.`analyzeAbstractCounterexample(AbstractCounterexample<?> acex, int low, int high)`
`static <E> int`	AcexAnalysisAlgorithms.`binarySearchLeft(AbstractCounterexample<E> acex, int low, int high)`
`static <E> int`	AcexAnalysisAlgorithms.`binarySearchRight(AbstractCounterexample<E> acex, int low, int high)`	Search for a suffix index using a binary search.
`static <E> int`	AcexAnalysisAlgorithms.`exponentialSearchBwd(AbstractCounterexample<E> acex, int low, int high)`	Search for a suffix index using an exponential search.
`static <E> int`	AcexAnalysisAlgorithms.`exponentialSearchFwd(AbstractCounterexample<E> acex, int low, int high)`
`static <E> int`	AcexAnalysisAlgorithms.`linearSearchBwd(AbstractCounterexample<E> acex, int low, int high)`	Scan linearly through the counterexample in descending order.
`static <E> int`	AcexAnalysisAlgorithms.`linearSearchFwd(AbstractCounterexample<E> acex, int low, int high)`	Scan linearly through the counterexample in ascending order.

Uses of Interfacede.learnlib.acex.AbstractCounterexample