Uses of Interface
net.automatalib.automaton.DeterministicAutomaton
-
Packages that use DeterministicAutomaton 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.concept net.automatalib.automaton.fsa net.automatalib.automaton.transducer 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.cover -
-
Uses of DeterministicAutomaton in net.automatalib.automaton
Subinterfaces of DeterministicAutomaton 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.interface
UniversalDeterministicAutomaton<S,I,T,SP,TP>
ADeterministicAutomaton
with state and transition properties.Classes in net.automatalib.automaton that implement DeterministicAutomaton 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 DeterministicAutomaton in net.automatalib.automaton.abstraction
Classes in net.automatalib.automaton.abstraction with type parameters of type DeterministicAutomaton Modifier and Type Class Description static class
DeterministicAbstractions.StateIntAbstraction<S,I,T,A extends DeterministicAutomaton<S,I,T>>
-
Uses of DeterministicAutomaton in net.automatalib.automaton.base
Classes in net.automatalib.automaton.base that implement DeterministicAutomaton 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 DeterministicAutomaton in net.automatalib.automaton.concept
Subinterfaces of DeterministicAutomaton in net.automatalib.automaton.concept Modifier and Type Interface Description interface
DetOutputAutomaton<S,I,T,D>
An automaton which deterministically produces an output for an input word.interface
DetSuffixOutputAutomaton<S,I,T,D>
-
Uses of DeterministicAutomaton in net.automatalib.automaton.fsa
Subinterfaces of DeterministicAutomaton 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 DeterministicAutomaton Modifier and Type Class Description class
CompactDFA<I>
class
FastDFA<I>
-
Uses of DeterministicAutomaton in net.automatalib.automaton.transducer
Subinterfaces of DeterministicAutomaton 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
StateOutputAutomaton<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
.interface
TransitionOutputAutomaton<S,I,T,O>
Classes in net.automatalib.automaton.transducer that implement DeterministicAutomaton 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 DeterministicAutomaton in net.automatalib.brics
Classes in net.automatalib.brics that implement DeterministicAutomaton Modifier and Type Class Description class
BricsDFA
Adapter class for wrapping a Brics automaton as aDFA
. -
Uses of DeterministicAutomaton in net.automatalib.modelchecking
Subinterfaces of DeterministicAutomaton in net.automatalib.modelchecking Modifier and Type Interface Description interface
Lasso<I,D>
A lasso is a single infinite word.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 DeterministicAutomaton Modifier and Type Class Description class
AbstractLasso<I,D>
class
DFALassoImpl<I>
A DFALasso is a lasso forDFA
s.class
MealyLassoImpl<I,O>
A MealyLasso is a lasso forMealyMachine
s. -
Uses of DeterministicAutomaton in net.automatalib.util.automaton
Methods in net.automatalib.util.automaton with parameters of type DeterministicAutomaton Modifier and Type Method Description static <I> List<Word<I>>
Automata. stateCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)
Convenient method for computing a state cover.static <I> List<Word<I>>
Automata. structuralCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)
Convenient method for computing a structural cover.static <I> List<Word<I>>
Automata. transitionCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)
Convenient method for computing a state cover. -
Uses of DeterministicAutomaton in net.automatalib.util.automaton.cover
Methods in net.automatalib.util.automaton.cover with parameters of type DeterministicAutomaton Modifier and Type Method Description static <I> void
Covers. cover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> states, Collection<? super Word<I>> transitions)
Utility method that allows to compute a state and transition cover simultaneously.static <I> boolean
Covers. incrementalCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldStateCover, Collection<? extends Word<I>> oldTransCover, Collection<? super Word<I>> newStateCover, Collection<? super Word<I>> newTransCover)
Utility method that allows to compute an incremental state and transition cover simultaneously.static <S,I>
booleanCovers. incrementalStateCover(DeterministicAutomaton<S,I,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldStates, Collection<? super Word<I>> newStates)
Computes an incremental state cover for a given automaton, i.e. a cover that only contains the missing sequences for obtaining a complete state cover.static <I> Iterator<Word<I>>
Covers. incrementalStateCoverIterator(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> stateCover)
Returns an iterator for the remaining sequences of a state cover.static <I> boolean
Covers. incrementalStructuralCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldCover, Collection<? super Word<I>> newCover)
Computes an incremental structural cover for a given automaton, i.e. a cover that only contains the missing sequences for obtaining a complete structural cover.static <I> boolean
Covers. incrementalTransitionCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldTransCover, Collection<? super Word<I>> newTransCover)
Computes an incremental transition cover for a given automaton, i.e. a cover that only contains the missing sequences for obtaining a complete transition cover.static <I> Iterator<Word<I>>
Covers. incrementalTransitionCoverIterator(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> transitionCover)
Returns an iterator for the remaining sequences of a transition cover.static <I> void
Covers. stateCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> states)
Computes a state cover for a given automaton.static <I> Iterator<Word<I>>
Covers. stateCoverIterator(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)
Returns an iterator for the sequences of a state cover.static <I> void
Covers. structuralCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> cover)
Computes a structural cover for a given automaton.static <I> void
Covers. transitionCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> transitions)
Computes a transition cover for a given automaton.static <I> Iterator<Word<I>>
Covers. transitionCoverIterator(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)
Returns an iterator for the sequences of a transition cover.
-