Uses of Interface
net.automatalib.automaton.simple.SimpleDeterministicAutomaton.FullIntAbstraction
-
Packages that use SimpleDeterministicAutomaton.FullIntAbstraction Package Description net.automatalib.automaton This package (including sub-packages) contains the basic classes concerning automata.net.automatalib.automaton.abstraction net.automatalib.automaton.base net.automatalib.automaton.fsa net.automatalib.automaton.simple net.automatalib.automaton.transducer net.automatalib.util.partitionrefinement -
-
Uses of SimpleDeterministicAutomaton.FullIntAbstraction in net.automatalib.automaton
Subinterfaces of SimpleDeterministicAutomaton.FullIntAbstraction in net.automatalib.automaton Modifier and Type Interface Description static interface
DeterministicAutomaton.FullIntAbstraction<T>
Interface forfull integer abstractions
of aDeterministicAutomaton
.static interface
MutableDeterministic.FullIntAbstraction<T,SP,TP>
Interface forfull integer abstractions
of aMutableDeterministic
.static interface
UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>
Interface forfull integer abstractions
of aUniversalDeterministicAutomaton
.Classes in net.automatalib.automaton that implement SimpleDeterministicAutomaton.FullIntAbstraction Modifier and Type Class Description class
UniversalCompactDet<I,SP,TP>
A default implementation forAbstractCompactDeterministic
that usesCompactTransition
as transition type and supports various types of state and transition properties.class
UniversalCompactSimpleDet<I,SP>
AAbstractCompactSimpleDeterministic
-based implementation for automata that need to store generic state properties. -
Uses of SimpleDeterministicAutomaton.FullIntAbstraction in net.automatalib.automaton.abstraction
Classes in net.automatalib.automaton.abstraction that implement SimpleDeterministicAutomaton.FullIntAbstraction Modifier and Type Class Description static class
DeterministicAbstractions.FullIntAbstraction<I,T,A extends DeterministicAutomaton.StateIntAbstraction<I,T>>
static class
MutableDeterministicAbstraction.FullIntAbstraction<I,T,SP,TP,A extends MutableDeterministic.StateIntAbstraction<I,T,SP,TP>>
static class
SimpleDeterministicAbstractions.FullIntAbstraction<I,A extends SimpleDeterministicAutomaton.StateIntAbstraction<I>>
Base class implementing the default way of obtaining aSimpleDeterministicAbstractions.FullIntAbstraction
, i.e., building on top of aSimpleDeterministicAbstractions.StateIntAbstraction
and a mapping from integers to (concrete) input symbols.static class
UniversalDeterministicAbstractions.FullIntAbstraction<I,T,SP,TP,A extends UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>>
-
Uses of SimpleDeterministicAutomaton.FullIntAbstraction in net.automatalib.automaton.base
Classes in net.automatalib.automaton.base that implement SimpleDeterministicAutomaton.FullIntAbstraction Modifier and Type Class Description class
AbstractCompactDeterministic<I,T,SP,TP>
Abstract super class that refinesAbstractCompact
for deterministic automata.class
AbstractCompactSimpleDeterministic<I,SP>
Abstract super class that refinesAbstractCompactDeterministic
for transition-property-less automata. -
Uses of SimpleDeterministicAutomaton.FullIntAbstraction in net.automatalib.automaton.fsa
Classes in net.automatalib.automaton.fsa that implement SimpleDeterministicAutomaton.FullIntAbstraction Modifier and Type Class Description class
CompactDFA<I>
-
Uses of SimpleDeterministicAutomaton.FullIntAbstraction in net.automatalib.automaton.simple
Methods in net.automatalib.automaton.simple that return SimpleDeterministicAutomaton.FullIntAbstraction Modifier and Type Method Description default SimpleDeterministicAutomaton.FullIntAbstraction
SimpleDeterministicAutomaton. fullIntAbstraction(int numInputs, IntFunction<? extends I> symMapping)
Retrieves aSimpleDeterministicAutomaton.FullIntAbstraction
of this automaton, using the given number of (abstract) inputs and the inputs mapping.default SimpleDeterministicAutomaton.FullIntAbstraction
SimpleDeterministicAutomaton. fullIntAbstraction(Alphabet<I> alphabet)
Retrieves aSimpleDeterministicAutomaton.FullIntAbstraction
of this automaton, using the mapping induced by the given alphabet as the abstraction for the input symbols. -
Uses of SimpleDeterministicAutomaton.FullIntAbstraction in net.automatalib.automaton.transducer
Classes in net.automatalib.automaton.transducer that implement SimpleDeterministicAutomaton.FullIntAbstraction Modifier and Type Class Description class
CompactMealy<I,O>
class
CompactMoore<I,O>
class
CompactSST<I,O>
-
Uses of SimpleDeterministicAutomaton.FullIntAbstraction in net.automatalib.util.partitionrefinement
Methods in net.automatalib.util.partitionrefinement with parameters of type SimpleDeterministicAutomaton.FullIntAbstraction Modifier and Type Method Description static void
PaigeTarjanInitializers. initCompleteDeterministic(PaigeTarjan pt, SimpleDeterministicAutomaton.FullIntAbstraction absAutomaton, IntFunction<?> initialClassification, boolean pruneUnreachable)
Initializes the partition refinement data structure from a given abstracted deterministic automaton, partitioning states according to the given classification function.static void
PaigeTarjanInitializers. initDeterministic(PaigeTarjan pt, SimpleDeterministicAutomaton.FullIntAbstraction absAutomaton, IntFunction<?> initialClassification, Object sinkClassification)
Initializes the partition refinement data structure from a given deterministic automaton, initializing the initial partition according to the given classification function.static <I,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>>
APaigeTarjanExtractors. toDeterministic(PaigeTarjan pt, AutomatonCreator<A,I> creator, Alphabet<I> inputs, SimpleDeterministicAutomaton.FullIntAbstraction absOriginal, IntFunction<? extends SP> spExtractor, BiIntFunction<? extends TP> tpExtractor, boolean pruneUnreachable)
Translates the results of the coarsest stable partition computation into a deterministic automaton.
-