Uses of Interface
net.automatalib.ts.simple.SimpleTS
-
-
Uses of SimpleTS in net.automatalib.automaton
Subinterfaces of SimpleTS in net.automatalib.automaton Modifier and Type Interface Description interface
Automaton<S,I,T>
Basic interface for an automaton.interface
DeterministicAutomaton<S,I,T>
Basic interface for a deterministic automaton.interface
FiniteAlphabetAutomaton<S,I,T>
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
UniversalAutomaton<S,I,T,SP,TP>
A universal automaton is a generalized representation of automata, with unified access to the properties 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 SimpleTS 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 SimpleTS in net.automatalib.automaton.base
Classes in net.automatalib.automaton.base that implement SimpleTS 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 SimpleTS in net.automatalib.automaton.concept
Subinterfaces of SimpleTS 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>
interface
OutputAutomaton<S,I,T,D>
-
Uses of SimpleTS in net.automatalib.automaton.fsa
Subinterfaces of SimpleTS 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 SimpleTS Modifier and Type Class Description class
CompactDFA<I>
class
CompactNFA<I>
class
FastDFA<I>
class
FastNFA<I>
-
Uses of SimpleTS in net.automatalib.automaton.procedural
Subinterfaces of SimpleTS in net.automatalib.automaton.procedural Modifier and Type Interface Description interface
SBA<S,I>
A system of behavioral automata.interface
SPA<S,I>
A system of procedural automata.interface
SPMM<S,I,T,O>
A system of procedural Mealy machines.Classes in net.automatalib.automaton.procedural that implement SimpleTS Modifier and Type Class Description class
EmptySBA<I>
A utility implementation of anSBA
that rejects all inputs, i.e., which describes the empty language.class
EmptySPA<I>
A utility implementation of anSPA
that rejects all inputs, i.e., describes the empty language.class
EmptySPMM<I,O>
A utility implementation of anSPMM
that transduces all input words to a sequence of the given erroneous output symbol.class
StackSBA<S,I>
A stack-based implementation for the (instrumented) language of anSBA
.class
StackSPA<S,I>
A stack-based implementation for the (instrumented) language of anSPA
.class
StackSPMM<S,I,T,O>
A stack-based implementation for the (instrumented) transductions of anSPMM
. -
Uses of SimpleTS in net.automatalib.automaton.simple
Subinterfaces of SimpleTS in net.automatalib.automaton.simple Modifier and Type Interface Description interface
SimpleAutomaton<S,I>
A simple automaton, i.e., aSimpleTS
with a finite number of states.interface
SimpleDeterministicAutomaton<S,I>
A simple deterministic automaton. -
Uses of SimpleTS in net.automatalib.automaton.transducer
Subinterfaces of SimpleTS 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 SimpleTS 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 SimpleTS in net.automatalib.automaton.transducer.probabilistic
Subinterfaces of SimpleTS in net.automatalib.automaton.transducer.probabilistic Modifier and Type Interface Description interface
MutableProbabilisticMealy<S,I,T,O>
interface
ProbabilisticMealyMachine<S,I,T,O>
Classes in net.automatalib.automaton.transducer.probabilistic that implement SimpleTS Modifier and Type Class Description class
FastProbMealy<I,O>
-
Uses of SimpleTS in net.automatalib.automaton.vpa
Subinterfaces of SimpleTS in net.automatalib.automaton.vpa Modifier and Type Interface Description interface
OneSEVPA<L,I>
A specialized interface for 1-SEVPAs (1-module single entry visibly push-down automata).interface
SEVPA<L,I>
Interface for k-SEVPAs (k-module single entry visibly push-down automata), a visibly push-down automaton of specific structure and semantics.Classes in net.automatalib.automaton.vpa that implement SimpleTS Modifier and Type Class Description class
AbstractDefaultSEVPA<I>
Basic functionality forLocation
-based SEVPA implementations.class
AbstractSEVPA<L,I>
Abstract class for k-SEVPAs that implements functionality shared across different subtypes.class
DefaultNSEVPA<I>
Default implementation for n-SEVPAs.class
DefaultOneSEVPA<I>
Default implementation for 1-SEVPAs. -
Uses of SimpleTS in net.automatalib.brics
Classes in net.automatalib.brics that implement SimpleTS 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 SimpleTS in net.automatalib.modelchecking
Subinterfaces of SimpleTS 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 SimpleTS 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 SimpleTS in net.automatalib.serialization
Classes in net.automatalib.serialization with type parameters of type SimpleTS Modifier and Type Class Description class
InputModelData<I,M extends SimpleTS<?,I>>
A utility data class, that allows to pair a model that can react to input symbols with a corresponding alphabet.interface
InputModelDeserializer<I,M extends SimpleTS<?,I>>
A refinement of theModelDeserializer
interface for arbitrary models that can react to inputs.interface
InputModelSerializationProvider<I,OUT extends SimpleTS<?,I>,IN extends SimpleTS<?,I>>
A utility interface that unionsInputModelSerializer
andInputModelDeserializer
and extendsSerializationProvider
.interface
InputModelSerializationProvider<I,OUT extends SimpleTS<?,I>,IN extends SimpleTS<?,I>>
A utility interface that unionsInputModelSerializer
andInputModelDeserializer
and extendsSerializationProvider
.interface
InputModelSerializer<I,M extends SimpleTS<?,I>>
A refinement of theModelSerializer
interface for arbitrary models that can react to inputs.Fields in net.automatalib.serialization declared as SimpleTS Modifier and Type Field Description M
InputModelData. model
-
Uses of SimpleTS in net.automatalib.serialization.dot
Classes in net.automatalib.serialization.dot with type parameters of type SimpleTS Modifier and Type Class Description class
DOTInputModelData<S,I,M extends SimpleTS<S,I>>
A utility data class, that extendsInputModelData
by labeling information of the model's states.interface
DOTInputModelDeserializer<S,I,M extends SimpleTS<S,I>>
A specialization of theInputModelDeserializer
that returns aDOTInputModelData
object which holds additional information about the state labels of the de-serialized automaton. -
Uses of SimpleTS in net.automatalib.ts
Subinterfaces of SimpleTS in net.automatalib.ts Modifier and Type Interface Description interface
DeterministicTransitionSystem<S,I,T>
Deterministic transition system.interface
FiniteKTS<S,I,T,AP>
A finite Kripke Transition System combines the properties of afinite transition system
and aKripkeInterpretation
.interface
PowersetViewTS<S,I,T,OS,OT>
interface
TransitionSystem<S,I,T>
Transition system interface.interface
UniversalDTS<S,I,T,SP,TP>
Universal deterministic transition system.interface
UniversalTransitionSystem<S,I,T,SP,TP>
A "universal" transition system, which captures the possibility to assign properties to states and transitions. -
Uses of SimpleTS in net.automatalib.ts.acceptor
Subinterfaces of SimpleTS in net.automatalib.ts.acceptor Modifier and Type Interface Description interface
AcceptorTS<S,I>
A transition system whose semantics are defined by whether a state is "accepting" or not.interface
DeterministicAcceptorTS<S,I>
A deterministic acceptor transition system. -
Uses of SimpleTS in net.automatalib.ts.modal
Subinterfaces of SimpleTS 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 SimpleTS Modifier and Type Class Description class
AbstractCompactMTS<I,T,TP extends MutableModalEdgeProperty>
An abstract base-implementation forMutableModalTransitionSystem
s.class
CompactMTS<I>
-
Uses of SimpleTS in net.automatalib.ts.output
Subinterfaces of SimpleTS in net.automatalib.ts.output Modifier and Type Interface Description interface
DeterministicOutputTS<S,I,T,O>
interface
DeterministicStateOutputTS<S,I,T,O>
interface
DeterministicTransitionOutputTS<S,I,T,O>
interface
MealyTransitionSystem<S,I,T,O>
interface
MooreTransitionSystem<S,I,T,O>
-
Uses of SimpleTS in net.automatalib.ts.powerset
Classes in net.automatalib.ts.powerset that implement SimpleTS Modifier and Type Class Description class
DeterministicPowersetView<S,I,T>
class
DirectPowersetDTS<S,I,T>
class
FastPowersetDTS<S extends NumericID,I,T>
-
Uses of SimpleTS in net.automatalib.ts.simple
Subinterfaces of SimpleTS in net.automatalib.ts.simple Modifier and Type Interface Description interface
SimpleDTS<S,I>
A simple deterministic transition system. -
Uses of SimpleTS in net.automatalib.util.automaton.vpa
Classes in net.automatalib.util.automaton.vpa that implement SimpleTS Modifier and Type Class Description class
ProductOneSEVPA<L1,L2,I>
Production automaton that allows to join two givenOneSEVPA
s. -
Uses of SimpleTS in net.automatalib.util.ts.comp
Classes in net.automatalib.util.ts.comp that implement SimpleTS Modifier and Type Class Description class
DTSComposition<S1,S2,I,T1,T2,TS1 extends DeterministicTransitionSystem<S1,I,T1>,TS2 extends DeterministicTransitionSystem<S2,I,T2>>
class
TSComposition<S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>>
-