Uses of Interface
net.automatalib.ts.TransitionSystem
-
-
Uses of TransitionSystem in net.automatalib.automaton
Subinterfaces of TransitionSystem 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 TransitionSystem 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 TransitionSystem in net.automatalib.automaton.base
Classes in net.automatalib.automaton.base that implement TransitionSystem 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 TransitionSystem in net.automatalib.automaton.concept
Subinterfaces of TransitionSystem 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 TransitionSystem in net.automatalib.automaton.fsa
Subinterfaces of TransitionSystem 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 TransitionSystem Modifier and Type Class Description class
CompactDFA<I>
class
CompactNFA<I>
class
FastDFA<I>
class
FastNFA<I>
-
Uses of TransitionSystem in net.automatalib.automaton.procedural
Subinterfaces of TransitionSystem 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 TransitionSystem 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 TransitionSystem in net.automatalib.automaton.transducer
Subinterfaces of TransitionSystem 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 TransitionSystem 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 TransitionSystem in net.automatalib.automaton.transducer.probabilistic
Subinterfaces of TransitionSystem 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 TransitionSystem Modifier and Type Class Description class
FastProbMealy<I,O>
-
Uses of TransitionSystem in net.automatalib.automaton.vpa
Subinterfaces of TransitionSystem 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 TransitionSystem 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 TransitionSystem in net.automatalib.brics
Classes in net.automatalib.brics that implement TransitionSystem 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 TransitionSystem in net.automatalib.modelchecking
Subinterfaces of TransitionSystem 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 TransitionSystem 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 TransitionSystem in net.automatalib.ts
Subinterfaces of TransitionSystem 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
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 TransitionSystem in net.automatalib.ts.acceptor
Subinterfaces of TransitionSystem 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 TransitionSystem in net.automatalib.ts.modal
Subinterfaces of TransitionSystem 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 TransitionSystem Modifier and Type Class Description class
AbstractCompactMTS<I,T,TP extends MutableModalEdgeProperty>
An abstract base-implementation forMutableModalTransitionSystem
s.class
CompactMTS<I>
-
Uses of TransitionSystem in net.automatalib.ts.output
Subinterfaces of TransitionSystem 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 TransitionSystem in net.automatalib.ts.powerset
Classes in net.automatalib.ts.powerset that implement TransitionSystem Modifier and Type Class Description class
DeterministicPowersetView<S,I,T>
class
DirectPowersetDTS<S,I,T>
class
FastPowersetDTS<S extends NumericID,I,T>
Constructors in net.automatalib.ts.powerset with parameters of type TransitionSystem Constructor Description DirectPowersetDTS(TransitionSystem<S,I,T> ts)
FastPowersetDTS(TransitionSystem<S,I,T> ts)
-
Uses of TransitionSystem in net.automatalib.util.automaton.copy
Classes in net.automatalib.util.automaton.copy with type parameters of type TransitionSystem Modifier and Type Class Description class
AbstractLowLevelAutomatonCopier<S1,I1,T1,S2,I2,T2,SP2,TP2,TS1 extends TransitionSystem<S1,? super I1,T1>>
Fields in net.automatalib.util.automaton.copy declared as TransitionSystem Modifier and Type Field Description protected TS1
AbstractLowLevelAutomatonCopier. in
-
Uses of TransitionSystem in net.automatalib.util.automaton.vpa
Classes in net.automatalib.util.automaton.vpa that implement TransitionSystem Modifier and Type Class Description class
ProductOneSEVPA<L1,L2,I>
Production automaton that allows to join two givenOneSEVPA
s. -
Uses of TransitionSystem in net.automatalib.util.ts
Methods in net.automatalib.util.ts with parameters of type TransitionSystem Modifier and Type Method Description static <S,I>
Iterable<TS.TransRef<S,I,?>>TS. allDefinedInputs(TransitionSystem<S,I,?> ts, Iterable<? extends S> states, Iterable<? extends I> inputs)
static <S,I>
Iterator<TS.TransRef<S,I,?>>TS. allDefinedInputsIterator(TransitionSystem<S,I,?> ts, Iterator<? extends S> stateIt, Iterable<? extends I> inputs)
static <S,I>
Iterable<TS.TransRef<S,I,?>>TS. allUndefinedTransitions(TransitionSystem<S,I,?> ts, Iterable<? extends S> states, Iterable<? extends I> inputs)
static <S,I>
Iterator<TS.TransRef<S,I,?>>TS. allUndefinedTransitionsIterator(TransitionSystem<S,I,?> ts, Iterator<? extends S> stateIt, Iterable<? extends I> inputs)
static <S,I>
Iterator<I>TS. definedInputsIterator(TransitionSystem<S,I,?> ts, S state, Iterator<? extends I> inputsIt)
static <S,I>
Iterable<I>TS. undefinedInputs(TransitionSystem<S,I,?> ts, S state, Iterable<? extends I> inputs)
static <S,I>
Iterator<I>TS. undefinedInputsIterator(TransitionSystem<S,I,?> ts, S state, Iterator<? extends I> inputsIt)
-
Uses of TransitionSystem in net.automatalib.util.ts.comp
Classes in net.automatalib.util.ts.comp with type parameters of type TransitionSystem Modifier and Type Class Description class
TSComposition<S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>>
class
TSComposition<S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>>
Classes in net.automatalib.util.ts.comp that implement TransitionSystem 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>>
Fields in net.automatalib.util.ts.comp declared as TransitionSystem Modifier and Type Field Description protected TS1
TSComposition. ts1
protected TS2
TSComposition. ts2
Methods in net.automatalib.util.ts.comp with type parameters of type TransitionSystem Modifier and Type Method Description static <S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>>
TransitionSystem<Pair<S1,S2>,I,Pair<T1,T2>>TSCompositions. compose(TS1 ts1, TS2 ts2)
static <S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>>
TransitionSystem<Pair<S1,S2>,I,Pair<T1,T2>>TSCompositions. compose(TS1 ts1, TS2 ts2)
Methods in net.automatalib.util.ts.comp that return TransitionSystem Modifier and Type Method Description static <S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>>
TransitionSystem<Pair<S1,S2>,I,Pair<T1,T2>>TSCompositions. compose(TS1 ts1, TS2 ts2)
-
Uses of TransitionSystem in net.automatalib.util.ts.copy
Methods in net.automatalib.util.ts.copy with parameters of type TransitionSystem Modifier and Type Method Description static <S1,I,T1,S2,T2,SP2,TP2>
Mapping<S1,S2>TSCopy. rawCopy(TSTraversalMethod method, TransitionSystem<S1,? super I,T1> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,SP2,TP2> out, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping)
Copies anAutomaton
to aMutableAutomaton
with a compatible input alphabet, but possibly heterogeneous state and transition properties.static <S1,I,T1,S2,T2,SP2,TP2>
Mapping<S1,S2>TSCopy. rawCopy(TSTraversalMethod method, TransitionSystem<S1,? super I,T1> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,SP2,TP2> out, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies anAutomaton
to aMutableAutomaton
with a compatible input alphabet, but possibly heterogeneous state and transition properties.static <S1,I1,T1,S2,I2,T2,SP2,TP2>
Mapping<S1,S2>TSCopy. rawCopy(TSTraversalMethod method, TransitionSystem<S1,? super I1,T1> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping)
Copies anAutomaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties.static <S1,I1,T1,S2,I2,T2,SP2,TP2>
Mapping<S1,S2>TSCopy. rawCopy(TSTraversalMethod method, TransitionSystem<S1,? super I1,T1> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputsMapping, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies anTransitionSystem
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties.Constructors in net.automatalib.util.ts.copy with parameters of type TransitionSystem Constructor Description TSCopyVisitor(TransitionSystem<S1,? super I1,T1> in, MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out, Function<? super I1,? extends I2> inputMapping, Function<? super S1,? extends SP2> spMapping, Function<? super T1,? extends TP2> tpMapping, Predicate<? super S1> stateFilter, TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
-
Uses of TransitionSystem in net.automatalib.util.ts.iterator
Constructors in net.automatalib.util.ts.iterator with parameters of type TransitionSystem Constructor Description AllDefinedInputsIterator(Iterator<? extends S> stateIt, TransitionSystem<S,I,?> ts, Iterable<? extends I> inputs)
AllUndefinedInputsIterator(Iterator<? extends S> stateIt, TransitionSystem<S,I,?> ts, Iterable<? extends I> inputs)
DefinedInputsIterator(TransitionSystem<S,I,?> ts, S state, Iterator<? extends I> inputsIt)
UndefinedInputsIterator(TransitionSystem<S,I,?> ts, S state, Iterator<? extends I> inputsIt)
-
Uses of TransitionSystem in net.automatalib.util.ts.traversal
Methods in net.automatalib.util.ts.traversal with parameters of type TransitionSystem Modifier and Type Method Description static <S,I,T,D>
booleanTSTraversal. breadthFirst(TransitionSystem<S,? super I,T> ts, int limit, Collection<? extends I> inputs, TSTraversalVisitor<S,I,T,D> visitor)
Traverses the given transition system in a breadth-first fashion.static <S,I,T,D>
voidTSTraversal. breadthFirst(TransitionSystem<S,? super I,T> ts, Collection<? extends I> inputs, TSTraversalVisitor<S,I,T,D> visitor)
Traverses the given transition system in a breadth-first fashion.static <S,I>
Iterator<S>TSTraversal. breadthFirstIterator(TransitionSystem<S,I,?> ts, Collection<? extends I> inputs)
Returns anIterator
for the (reachable) states of the given transition system in breadth-first order.static <S,I>
Iterable<S>TSTraversal. breadthFirstOrder(TransitionSystem<S,I,?> ts, Collection<? extends I> inputs)
Returns anIterable
for the (reachable) states of the given transition system in breadth-first order.static <S,I,T,D>
booleanTSTraversal. depthFirst(TransitionSystem<S,? super I,T> ts, int limit, Collection<? extends I> inputs, TSTraversalVisitor<S,I,T,D> visitor)
Traverses the given transition system in a depth-first fashion.static <S,I,T,D>
voidTSTraversal. depthFirst(TransitionSystem<S,I,T> ts, Collection<? extends I> inputs, TSTraversalVisitor<S,I,T,D> visitor)
Traverses the given transition system in a depth-first fashion.static <S,I>
Iterator<S>TSTraversal. depthFirstIterator(TransitionSystem<S,I,?> ts, Collection<? extends I> inputs)
Returns anIterator
for the (reachable) states of the given transition system in depth-first order.static <S,I>
Iterable<S>TSTraversal. depthFirstOrder(TransitionSystem<S,I,?> ts, Collection<? extends I> inputs)
Returns anIterable
for the (reachable) states of the given transition system in depth-first order.static <S,I,T,D>
booleanTSTraversal. traverse(TraversalOrder order, TransitionSystem<S,? super I,T> ts, int limit, Collection<? extends I> inputs, TSTraversalVisitor<S,I,T,D> visitor)
Traverses the given transition system in a given order.static <S,I,T,D>
voidTSTraversal. traverse(TraversalOrder order, TransitionSystem<S,? super I,T> ts, Collection<? extends I> inputs, TSTraversalVisitor<S,I,T,D> visitor)
Traverses the given transition system in a given order.<S,I,T,D>
voidTSTraversalMethod. traverse(TransitionSystem<S,? super I,T> ts, int limit, Collection<? extends I> inputs, TSTraversalVisitor<S,I,T,D> visitor)
-