Uses of Interface
net.automatalib.automaton.UniversalDeterministicAutomaton
-
Packages that use UniversalDeterministicAutomaton 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.procedural net.automatalib.automaton.transducer net.automatalib.automaton.visualization net.automatalib.brics This package contains adapter classes for treating the Automaton objects from the BRICS library as AutomataLib models.net.automatalib.modelchecking net.automatalib.util.automaton net.automatalib.util.automaton.conformance net.automatalib.util.automaton.equivalence net.automatalib.util.automaton.minimizer.hopcroft net.automatalib.util.automaton.minimizer.paigetarjan net.automatalib.util.partitionrefinement -
-
Uses of UniversalDeterministicAutomaton in net.automatalib.automaton
Subinterfaces of UniversalDeterministicAutomaton in net.automatalib.automaton Modifier and Type Interface Description interface
MutableDeterministic<S,I,T,SP,TP>
Interface for a mutable deterministic automaton.interface
ShrinkableDeterministic<S,I,T,SP,TP>
A mutable deterministic automaton that also supports destructive operations, i.e., removal of states and transitions.Classes in net.automatalib.automaton that implement UniversalDeterministicAutomaton 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 UniversalDeterministicAutomaton in net.automatalib.automaton.abstraction
Classes in net.automatalib.automaton.abstraction with type parameters of type UniversalDeterministicAutomaton Modifier and Type Class Description static class
UniversalDeterministicAbstractions.StateIntAbstraction<S,I,T,SP,TP,A extends UniversalDeterministicAutomaton<S,I,T,SP,TP>>
-
Uses of UniversalDeterministicAutomaton in net.automatalib.automaton.base
Classes in net.automatalib.automaton.base that implement UniversalDeterministicAutomaton 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.class
AbstractFastMutableDet<S extends AbstractFastState<T>,I,T,SP,TP>
-
Uses of UniversalDeterministicAutomaton in net.automatalib.automaton.fsa
Subinterfaces of UniversalDeterministicAutomaton in net.automatalib.automaton.fsa Modifier and Type Interface Description interface
DFA<S,I>
Deterministic finite state acceptor.interface
MutableDFA<S,I>
Classes in net.automatalib.automaton.fsa that implement UniversalDeterministicAutomaton Modifier and Type Class Description class
CompactDFA<I>
class
FastDFA<I>
-
Uses of UniversalDeterministicAutomaton in net.automatalib.automaton.procedural
Constructor parameters in net.automatalib.automaton.procedural with type arguments of type UniversalDeterministicAutomaton Constructor Description ProceduralGraphView(Alphabet<I> internalAlphabet, Collection<I> proceduralAlphabet, Map<I,? extends UniversalDeterministicAutomaton<? extends S,I,?,?,?>> subModels)
-
Uses of UniversalDeterministicAutomaton in net.automatalib.automaton.transducer
Subinterfaces of UniversalDeterministicAutomaton in net.automatalib.automaton.transducer Modifier and Type Interface Description interface
MealyMachine<S,I,T,O>
interface
MooreMachine<S,I,T,O>
interface
MutableMealyMachine<S,I,T,O>
interface
MutableMooreMachine<S,I,T,O>
interface
MutableSubsequentialTransducer<S,I,T,O>
Amutable
extension of aSubsequentialTransducer
.interface
StateLocalInputMealyMachine<S,I,T,O>
interface
SubsequentialTransducer<S,I,T,O>
A subsequential transducer (or SST) is anDeterministicOutputTS
whose state and transition properties are output-words
.Classes in net.automatalib.automaton.transducer that implement UniversalDeterministicAutomaton Modifier and Type Class Description class
CompactMealy<I,O>
class
CompactMoore<I,O>
class
CompactSST<I,O>
class
FastMealy<I,O>
A fast implementation of a Mealy machine.class
FastMoore<I,O>
A fast implementation of a Moore automaton. -
Uses of UniversalDeterministicAutomaton in net.automatalib.automaton.visualization
Constructor parameters in net.automatalib.automaton.visualization with type arguments of type UniversalDeterministicAutomaton Constructor Description ProceduralVisualizationHelper(Alphabet<I> internalAlphabet, Map<I,? extends UniversalDeterministicAutomaton<? extends S,I,?,?,?>> subModels)
-
Uses of UniversalDeterministicAutomaton in net.automatalib.brics
Classes in net.automatalib.brics that implement UniversalDeterministicAutomaton Modifier and Type Class Description class
BricsDFA
Adapter class for wrapping a Brics automaton as aDFA
. -
Uses of UniversalDeterministicAutomaton in net.automatalib.modelchecking
Subinterfaces of UniversalDeterministicAutomaton in net.automatalib.modelchecking Modifier and Type Interface Description static interface
Lasso.DFALasso<I>
A DFALasso is a lasso forDFA
s.static interface
Lasso.MealyLasso<I,O>
A MealyLasso is a lasso forMealyMachine
s.Classes in net.automatalib.modelchecking that implement UniversalDeterministicAutomaton Modifier and Type Class Description class
DFALassoImpl<I>
A DFALasso is a lasso forDFA
s.class
MealyLassoImpl<I,O>
A MealyLasso is a lasso forMealyMachine
s. -
Uses of UniversalDeterministicAutomaton in net.automatalib.util.automaton
Methods in net.automatalib.util.automaton with parameters of type UniversalDeterministicAutomaton Modifier and Type Method Description static <I> List<Word<I>>
Automata. characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs)
Computes a characterizing set, and returns it as aList
.static <I> void
Automata. characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> result)
Computes a characterizing set for the given automaton.static <I> @Nullable Word<I>
Automata. findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
Finds a separating word for two automata.static <S,I>
@Nullable Word<I>Automata. findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, S state1, S state2, Collection<? extends I> inputs)
Finds a separating word for two states in an automaton.static <I> @Nullable Word<I>
Automata. findShortestSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
Finds a shortest separating word for two automata.static <I> boolean
Automata. incrementalCharacterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldSuffixes, Collection<? super Word<I>> newSuffixes)
static <S,I,T,SP,TP,SO,TO,A extends MutableDeterministic<SO,? super I,TO,? super SP,? super TP>>
AAutomata. minimize(UniversalDeterministicAutomaton<S,I,T,SP,TP> automaton, Collection<? extends I> inputs, A output)
static <S,I>
List<Word<I>>Automata. stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Collection<? extends I> inputs, S state)
Computes a characterizing set for a single state, and returns it as aList
.static <S,I>
voidAutomata. stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Collection<? extends I> inputs, S state, Collection<? super Word<I>> result)
Computes a characterizing set for a single state.static <I> boolean
Automata. testEquivalence(UniversalDeterministicAutomaton<?,I,?,?,?> reference, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
Tests whether two automata are equivalent, i.e. whether there exists aseparating word
for the two given automata. -
Uses of UniversalDeterministicAutomaton in net.automatalib.util.automaton.conformance
Methods in net.automatalib.util.automaton.conformance with parameters of type UniversalDeterministicAutomaton Modifier and Type Method Description void
IncrementalWMethodTestsIterator. update(UniversalDeterministicAutomaton<?,I,?,?,?> automaton)
Constructors in net.automatalib.util.automaton.conformance with parameters of type UniversalDeterministicAutomaton Constructor Description WMethodTestsIterator(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs)
Convenience-constructor forWMethodTestsIterator(UniversalDeterministicAutomaton, Collection, int)
that selects0
asmaxDepth
.WMethodTestsIterator(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs, int maxDepth)
Constructor.WpMethodTestsIterator(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs)
Convenience-constructor forWpMethodTestsIterator(UniversalDeterministicAutomaton, Collection, int)
that selects0
asmaxDepth
.WpMethodTestsIterator(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs, int maxDepth)
Constructor. -
Uses of UniversalDeterministicAutomaton in net.automatalib.util.automaton.equivalence
Methods in net.automatalib.util.automaton.equivalence with parameters of type UniversalDeterministicAutomaton Modifier and Type Method Description static <I> Iterator<Word<I>>
CharacterizingSets. characterizingSetIterator(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs)
static <I> void
CharacterizingSets. findCharacterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> result)
Computes a characterizing set for the given automaton.static <S,I>
voidCharacterizingSets. findCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Collection<? extends I> inputs, S state, Collection<? super Word<I>> result)
Computes a characterizing set for a specified state in the given automaton.static <S,I>
booleanCharacterizingSets. findIncrementalCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldSuffixes, Collection<? super Word<I>> newSuffixes)
static <I,S,T,SP,TP,S2,T2,SP2,TP2>
@Nullable Word<I>DeterministicEquivalenceTest. findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> reference, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Collection<? extends I> inputs)
static <I> @Nullable Word<I>
NearLinearEquivalenceTest. findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> target, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
static <I> @Nullable Word<I>
NearLinearEquivalenceTest. findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> target, UniversalDeterministicAutomaton<?,I,?,?,?> other, Alphabet<I> inputs)
static <S,I>
@Nullable Word<I>NearLinearEquivalenceTest. findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> target, S init1, S init2, Collection<? extends I> inputs)
static <S,I,T>
@Nullable Word<I>NearLinearEquivalenceTest. findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, S init1, S init2, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
Find a separating word for two states in a given automaton.static <S,S2,I,T,T2,SP,SP2,TP,TP2>
@Nullable Word<I>NearLinearEquivalenceTest. findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> target, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
static <S,S2,I,T,T2,SP,SP2,TP,TP2>
@Nullable Word<I>NearLinearEquivalenceTest. findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> target, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Alphabet<I> inputs, boolean ignoreUndefinedTransitions)
static <I,S,T,SP,TP,S2,T2,SP2,TP2>
@Nullable Word<I>DeterministicEquivalenceTest. findSeparatingWordLarge(UniversalDeterministicAutomaton<S,I,T,SP,TP> reference, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Collection<? extends I> inputs)
static <I> Iterator<Word<I>>
CharacterizingSets. incrementalCharacterizingSetIterator(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldSuffixes)
-
Uses of UniversalDeterministicAutomaton in net.automatalib.util.automaton.minimizer.hopcroft
Methods in net.automatalib.util.automaton.minimizer.hopcroft with parameters of type UniversalDeterministicAutomaton Modifier and Type Method Description static <I,T,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>>
AHopcroftMinimization. minimizeUniversal(UniversalDeterministicAutomaton<?,I,T,SP,TP> automaton, Alphabet<I> alphabet, AutomatonCreator<A,I> creator, AutomatonInitialPartitioning ap, HopcroftMinimization.PruningMode pruningMode)
Minimizes the given automaton depending on the given partitioning function. -
Uses of UniversalDeterministicAutomaton in net.automatalib.util.automaton.minimizer.paigetarjan
Methods in net.automatalib.util.automaton.minimizer.paigetarjan with parameters of type UniversalDeterministicAutomaton Modifier and Type Method Description static <I,T,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>>
APaigeTarjanMinimization. minimizeUniversal(UniversalDeterministicAutomaton<?,I,T,SP,TP> automaton, Alphabet<I> alphabet, AutomatonCreator<A,I> creator, AutomatonInitialPartitioning ap, Object sinkClassification)
Minimizes the given automaton depending on the given partitioning function. -
Uses of UniversalDeterministicAutomaton in net.automatalib.util.partitionrefinement
Methods in net.automatalib.util.partitionrefinement with parameters of type UniversalDeterministicAutomaton Modifier and Type Method Description static <S,I>
StateSignatureStateSignature. byFullSignature(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Alphabet<I> alphabet, S state)
static <S,I>
StateSignatureStateSignature. byTransitionProperties(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Alphabet<I> alphabet, S state)
-