Uses of Interface
net.automatalib.ts.UniversalTransitionSystem

Packages that use UniversalTransitionSystem

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.procedural
net.automatalib.automaton.transducer
net.automatalib.automaton.transducer.probabilistic
net.automatalib.automaton.vpa
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.ts	This package (including sub-packages) contains the basic classes concerning transition systems.
net.automatalib.ts.acceptor
net.automatalib.ts.modal
net.automatalib.ts.output
net.automatalib.util.automaton.vpa
net.automatalib.util.ts
net.automatalib.util.ts.copy

Uses of UniversalTransitionSystem in net.automatalib.automaton

Subinterfaces of UniversalTransitionSystem 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	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>	A DeterministicAutomaton with state and transition properties.
interface	UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>

Classes in net.automatalib.automaton that implement UniversalTransitionSystem

Modifier and Type	Class	Description
class	UniversalCompactDet<I,SP,TP>	A default implementation for AbstractCompactDeterministic that uses CompactTransition as transition type and supports various types of state and transition properties.
class	UniversalCompactSimpleDet<I,SP>	A AbstractCompactSimpleDeterministic-based implementation for automata that need to store generic state properties.

Uses of UniversalTransitionSystem in net.automatalib.automaton.base

Classes in net.automatalib.automaton.base that implement UniversalTransitionSystem

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 refines AbstractCompact for deterministic automata.
class	AbstractCompactSimpleDeterministic<I,SP>	Abstract super class that refines AbstractCompactDeterministic for transition-property-less automata.
class	AbstractCompactSimpleNondet<I,SP>	Abstract super class that refines AbstractCompact 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 UniversalTransitionSystem in net.automatalib.automaton.fsa

Subinterfaces of UniversalTransitionSystem in net.automatalib.automaton.fsa

Modifier and Type	Interface	Description
interface	DFA<S,I>	Deterministic finite state acceptor.
interface	FiniteStateAcceptor<S,I>	FiniteStateAcceptors 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 UniversalTransitionSystem

Modifier and Type	Class	Description
class	CompactDFA<I>
class	CompactNFA<I>
class	FastDFA<I>
class	FastNFA<I>

Uses of UniversalTransitionSystem in net.automatalib.automaton.graph

Methods in net.automatalib.automaton.graph with parameters of type UniversalTransitionSystem

Modifier and Type	Method	Description
<TP> TransitionEdge.Property<I,TP>	TransitionEdge.property(UniversalTransitionSystem<?,?,T,?,TP> uts)

Uses of UniversalTransitionSystem in net.automatalib.automaton.procedural

Subinterfaces of UniversalTransitionSystem 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 UniversalTransitionSystem

Modifier and Type	Class	Description
class	EmptySBA<I>	A utility implementation of an SBA that rejects all inputs, i.e., which describes the empty language.
class	EmptySPA<I>	A utility implementation of an SPA that rejects all inputs, i.e., describes the empty language.
class	EmptySPMM<I,O>	A utility implementation of an SPMM 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 an SBA.
class	StackSPA<S,I>	A stack-based implementation for the (instrumented) language of an SPA.
class	StackSPMM<S,I,T,O>	A stack-based implementation for the (instrumented) transductions of an SPMM.

Uses of UniversalTransitionSystem in net.automatalib.automaton.transducer

Subinterfaces of UniversalTransitionSystem 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>	A mutable extension of a SubsequentialTransducer.
interface	StateLocalInputMealyMachine<S,I,T,O>
interface	SubsequentialTransducer<S,I,T,O>	A subsequential transducer (or SST) is an DeterministicOutputTS whose state and transition properties are output-words.

Classes in net.automatalib.automaton.transducer that implement UniversalTransitionSystem

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 UniversalTransitionSystem in net.automatalib.automaton.transducer.probabilistic

Subinterfaces of UniversalTransitionSystem 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 UniversalTransitionSystem

Modifier and Type	Class	Description
class	FastProbMealy<I,O>

Uses of UniversalTransitionSystem in net.automatalib.automaton.vpa

Subinterfaces of UniversalTransitionSystem 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 UniversalTransitionSystem

Modifier and Type	Class	Description
class	AbstractDefaultSEVPA<I>	Basic functionality for Location-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 UniversalTransitionSystem in net.automatalib.brics

Classes in net.automatalib.brics that implement UniversalTransitionSystem

Modifier and Type	Class	Description
class	AbstractBricsAutomaton	Base class for Brics automata adapters.
class	BricsDFA	Adapter class for wrapping a Brics automaton as a DFA.
class	BricsNFA	Adapter class for wrapping a Brics automaton as an NFA.

Uses of UniversalTransitionSystem in net.automatalib.modelchecking

Subinterfaces of UniversalTransitionSystem in net.automatalib.modelchecking

Modifier and Type	Interface	Description
static interface	Lasso.DFALasso<I>	A DFALasso is a lasso for DFAs.
static interface	Lasso.MealyLasso<I,O>	A MealyLasso is a lasso for MealyMachines.

Classes in net.automatalib.modelchecking that implement UniversalTransitionSystem

Modifier and Type	Class	Description
class	DFALassoImpl<I>	A DFALasso is a lasso for DFAs.
class	MealyLassoImpl<I,O>	A MealyLasso is a lasso for MealyMachines.

Uses of UniversalTransitionSystem in net.automatalib.ts

Subinterfaces of UniversalTransitionSystem in net.automatalib.ts

Modifier and Type	Interface	Description
interface	UniversalDTS<S,I,T,SP,TP>	Universal deterministic transition system.

Uses of UniversalTransitionSystem in net.automatalib.ts.acceptor

Subinterfaces of UniversalTransitionSystem 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 UniversalTransitionSystem in net.automatalib.ts.modal

Subinterfaces of UniversalTransitionSystem in net.automatalib.ts.modal

Modifier and Type	Interface	Description
interface	ModalTransitionSystem<S,I,T,TP extends ModalEdgeProperty>	A modal transition system is a UniversalAutomaton in which transitions can be marked as may or must edges.
interface	MutableModalTransitionSystem<S,I,T,TP extends MutableModalEdgeProperty>	A mutable version of ModalTransitionSystem that allows to add states and transitions.

Classes in net.automatalib.ts.modal that implement UniversalTransitionSystem

Modifier and Type	Class	Description
class	AbstractCompactMTS<I,T,TP extends MutableModalEdgeProperty>	An abstract base-implementation for MutableModalTransitionSystems.
class	CompactMTS<I>

Uses of UniversalTransitionSystem in net.automatalib.ts.output

Subinterfaces of UniversalTransitionSystem in net.automatalib.ts.output

Modifier and Type	Interface	Description
interface	MealyTransitionSystem<S,I,T,O>
interface	MooreTransitionSystem<S,I,T,O>

Uses of UniversalTransitionSystem in net.automatalib.util.automaton.vpa

Classes in net.automatalib.util.automaton.vpa that implement UniversalTransitionSystem

Modifier and Type	Class	Description
class	ProductOneSEVPA<L1,L2,I>	Production automaton that allows to join two given OneSEVPAs.

Uses of UniversalTransitionSystem in net.automatalib.util.ts

Methods in net.automatalib.util.ts with parameters of type UniversalTransitionSystem

Modifier and Type	Method	Description
static <S,SP> Function<S,SP>	TS.stateProperties(UniversalTransitionSystem<S,?,?,SP,?> uts)
static <T,TP> Function<T,TP>	TS.transitionProperties(UniversalTransitionSystem<?,?,T,?,TP> uts)

Uses of UniversalTransitionSystem in net.automatalib.util.ts.copy

Methods in net.automatalib.util.ts.copy with parameters of type UniversalTransitionSystem

Modifier and Type	Method	Description
static <S1,I,T1,SP,TP,S2,T2> Mapping<S1,S2>	TSCopy.copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I,T1,? extends SP,? extends TP> in, int limit, Collection<? extends I> inputs, MutableAutomaton<S2,I,T2,? super SP,? super TP> out)	Copies a UniversalAutomaton with compatible input alphabets and properties.
static <S1,I,T1,SP,TP,S2,T2> Mapping<S1,S2>	TSCopy.copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I,T1,? extends SP,? extends TP> in, int limit, 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 a UniversalAutomaton with compatible input alphabets and properties.
static <S1,I,T1,SP1,TP1,S2,T2,SP2,TP2> Mapping<S1,S2>	TSCopy.copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I,T1,? extends SP1,? extends TP1> in, int limit, 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 a UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly heterogeneous properties.
static <S1,I,T1,SP1,TP1,S2,T2,SP2,TP2> Mapping<S1,S2>	TSCopy.copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I,T1,? extends SP1,? extends TP1> in, int limit, 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 a UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly heterogeneous properties.
static <S1,I1,T1,SP,TP,S2,I2,T2> Mapping<S1,S2>	TSCopy.copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I1,T1,? extends SP,? extends TP> in, int limit, Collection<? extends I1> inputs, MutableAutomaton<S2,I2,T2,? super SP,? super TP> out, Function<? super I1,? extends I2> inputsMapping)	Copies a UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties.
static <S1,I1,T1,SP,TP,S2,I2,T2> Mapping<S1,S2>	TSCopy.copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I1,T1,? extends SP,? extends TP> in, int limit, 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 a UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties.
static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2> Mapping<S1,S2>	TSCopy.copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I1,T1,? extends SP1,? extends TP1> in, int limit, 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 a UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2> Mapping<S1,S2>	TSCopy.copy(TSTraversalMethod method, UniversalTransitionSystem<S1,? super I1,T1,? extends SP1,? extends TP1> in, int limit, 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 a UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.