Uses of Interface
net.automatalib.automaton.UniversalAutomaton
-
Packages that use UniversalAutomaton Package Description net.automatalib.automaton This package (including sub-packages) contains the basic classes concerning automata.net.automatalib.automaton.base net.automatalib.automaton.fsa net.automatalib.automaton.graph net.automatalib.automaton.transducer net.automatalib.automaton.transducer.probabilistic 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.serialization.saf net.automatalib.ts.modal net.automatalib.util.automaton.copy -
-
Uses of UniversalAutomaton in net.automatalib.automaton
Subinterfaces of UniversalAutomaton in net.automatalib.automaton Modifier and Type Interface Description interface
MutableAutomaton<S,I,T,SP,TP>
A mutable automaton.interface
MutableDeterministic<S,I,T,SP,TP>
Interface for a mutable deterministic automaton.interface
ShrinkableAutomaton<S,I,T,SP,TP>
A mutable automaton that also supports destructive modifications, i.e., removal of states and transitions.interface
ShrinkableDeterministic<S,I,T,SP,TP>
A mutable deterministic automaton that also supports destructive operations, i.e., removal of states and transitions.interface
UniversalDeterministicAutomaton<S,I,T,SP,TP>
ADeterministicAutomaton
with state and transition properties.interface
UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>
Classes in net.automatalib.automaton that implement UniversalAutomaton 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 UniversalAutomaton in net.automatalib.automaton.base
Classes in net.automatalib.automaton.base that implement UniversalAutomaton Modifier and Type Class Description class
AbstractCompact<I,T,SP,TP>
Abstract super class for compact automata representations.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
AbstractCompactSimpleNondet<I,SP>
Abstract super class that refinesAbstractCompact
for transition-property-less automata.class
AbstractFastMutable<S extends AbstractFastState<?>,I,T,SP,TP>
Shared functionality for (non-) deterministic mutable automata.class
AbstractFastMutableDet<S extends AbstractFastState<T>,I,T,SP,TP>
class
AbstractFastMutableNondet<S extends AbstractFastState<Collection<T>>,I,T,SP,TP>
-
Uses of UniversalAutomaton in net.automatalib.automaton.fsa
Subinterfaces of UniversalAutomaton in net.automatalib.automaton.fsa Modifier and Type Interface Description interface
DFA<S,I>
Deterministic finite state acceptor.interface
FiniteStateAcceptor<S,I>
FiniteStateAcceptor
s accept regular languages.interface
MutableDFA<S,I>
interface
MutableFSA<S,I>
interface
MutableNFA<S,I>
interface
NFA<S,I>
Nondeterministic finite state acceptor.Classes in net.automatalib.automaton.fsa that implement UniversalAutomaton Modifier and Type Class Description class
CompactDFA<I>
class
CompactNFA<I>
class
FastDFA<I>
class
FastNFA<I>
-
Uses of UniversalAutomaton in net.automatalib.automaton.graph
Classes in net.automatalib.automaton.graph with type parameters of type UniversalAutomaton Modifier and Type Class Description class
UniversalAutomatonGraphView<S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>>
-
Uses of UniversalAutomaton in net.automatalib.automaton.transducer
Subinterfaces of UniversalAutomaton 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 UniversalAutomaton 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 UniversalAutomaton in net.automatalib.automaton.transducer.probabilistic
Subinterfaces of UniversalAutomaton in net.automatalib.automaton.transducer.probabilistic Modifier and Type Interface Description interface
MutableProbabilisticMealy<S,I,T,O>
Classes in net.automatalib.automaton.transducer.probabilistic that implement UniversalAutomaton Modifier and Type Class Description class
FastProbMealy<I,O>
-
Uses of UniversalAutomaton in net.automatalib.brics
Classes in net.automatalib.brics that implement UniversalAutomaton Modifier and Type Class Description class
AbstractBricsAutomaton
Base class for Brics automata adapters.class
BricsDFA
Adapter class for wrapping a Brics automaton as aDFA
.class
BricsNFA
Adapter class for wrapping a Brics automaton as anNFA
. -
Uses of UniversalAutomaton in net.automatalib.modelchecking
Subinterfaces of UniversalAutomaton 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 UniversalAutomaton 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 UniversalAutomaton in net.automatalib.serialization.saf
Methods in net.automatalib.serialization.saf with parameters of type UniversalAutomaton Modifier and Type Method Description <I,SP,TP>
voidSAFOutput. writeAutomaton(UniversalAutomaton<?,I,?,SP,TP> source, Alphabet<I> alphabet, AutomatonType expectedType, BlockPropertyEncoder<? super SP> spEncoder, SinglePropertyEncoder<? super TP> tpEncoder)
-
Uses of UniversalAutomaton in net.automatalib.ts.modal
Subinterfaces of UniversalAutomaton in net.automatalib.ts.modal Modifier and Type Interface Description interface
ModalTransitionSystem<S,I,T,TP extends ModalEdgeProperty>
A modal transition system is aUniversalAutomaton
in which transitions can be marked asmay
ormust
edges.interface
MutableModalTransitionSystem<S,I,T,TP extends MutableModalEdgeProperty>
A mutable version ofModalTransitionSystem
that allows to add states and transitions.Classes in net.automatalib.ts.modal that implement UniversalAutomaton Modifier and Type Class Description class
AbstractCompactMTS<I,T,TP extends MutableModalEdgeProperty>
An abstract base-implementation forMutableModalTransitionSystem
s.class
CompactMTS<I>
-
Uses of UniversalAutomaton in net.automatalib.util.automaton.copy
Methods in net.automatalib.util.automaton.copy with parameters of type UniversalAutomaton Modifier and Type Method Description static <S1,I,T1,SP,TP,S2,T2>
Mapping<S1,S2>AutomatonLowLevelCopy. copy(AutomatonCopyMethod method, UniversalAutomaton<S1,? super I,T1,? extends SP,? extends TP> in, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP,? super TP> out)
Copies aUniversalAutomaton
with compatible input alphabets and properties.static <S1,I,T1,SP,TP,S2,T2>
Mapping<S1,S2>AutomatonLowLevelCopy. copy(AutomatonCopyMethod method, UniversalAutomaton<S1,? super I,T1,? extends SP,? extends TP> in, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP,? super TP> out, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies aUniversalAutomaton
with compatible input alphabets and properties.static <S1,I,T1,SP1,TP1,S2,T2,SP2,TP2>
Mapping<S1,S2>AutomatonLowLevelCopy. copy(AutomatonCopyMethod method, UniversalAutomaton<S1,? super I,T1,? extends SP1,? extends TP1> in, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP2,? super TP2> out, Function<? super SP1,? extends SP2> spTransform, Function<? super TP1,? extends TP2> tpTransform)
Copies aUniversalAutomaton
to aMutableAutomaton
with compatible input alphabets, but possibly heterogeneous properties.static <S1,I,T1,SP1,TP1,S2,T2,SP2,TP2>
Mapping<S1,S2>AutomatonLowLevelCopy. copy(AutomatonCopyMethod method, UniversalAutomaton<S1,? super I,T1,? extends SP1,? extends TP1> in, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP2,? super TP2> out, Function<? super SP1,? extends SP2> spTransform, Function<? super TP1,? extends TP2> tpTransform, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies aUniversalAutomaton
to aMutableAutomaton
with compatible input alphabets, but possibly heterogeneous properties.static <S1,I1,T1,SP,TP,S2,I2,T2>
Mapping<S1,S2>AutomatonLowLevelCopy. copy(AutomatonCopyMethod method, UniversalAutomaton<S1,? super I1,T1,? extends SP,? extends TP> in, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP,? super TP> out, Function<? super I1,? extends I2> inputsMapping)
Copies aUniversalAutomaton
with possibly heterogeneous input alphabets, but compatible properties.static <S1,I1,T1,SP,TP,S2,I2,T2>
Mapping<S1,S2>AutomatonLowLevelCopy. copy(AutomatonCopyMethod method, UniversalAutomaton<S1,? super I1,T1,? extends SP,? extends TP> in, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP,? super TP> out, Function<? super I1,? extends I2> inputsMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies aUniversalAutomaton
with possibly heterogeneous input alphabets, but compatible properties.static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2>
Mapping<S1,S2>AutomatonLowLevelCopy. copy(AutomatonCopyMethod method, UniversalAutomaton<S1,? super I1,T1,? extends SP1,? extends TP1> in, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super SP1,? extends SP2> spTransform, Function<? super TP1,? extends TP2> tpTransform)
Copies aUniversalAutomaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties.static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2>
Mapping<S1,S2>AutomatonLowLevelCopy. copy(AutomatonCopyMethod method, UniversalAutomaton<S1,? super I1,T1,? extends SP1,? extends TP1> in, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super SP1,? extends SP2> spTransform, Function<? super TP1,? extends TP2> tpTransform, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies aUniversalAutomaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties.
-