Uses of Interface
net.automatalib.automaton.concept.FiniteRepresentation

Packages that use FiniteRepresentation

Package	Description
net.automatalib.automaton	This package (including sub-packages) contains the basic classes concerning automata.
net.automatalib.automaton.abstraction
net.automatalib.automaton.concept
net.automatalib.automaton.fsa
net.automatalib.automaton.graph
net.automatalib.automaton.procedural
net.automatalib.automaton.simple
net.automatalib.automaton.transducer
net.automatalib.automaton.transducer.probabilistic
net.automatalib.automaton.vpa
net.automatalib.graph	This package (including sub-packages) contains the basic classes concerning graphs.
net.automatalib.graph.ads
net.automatalib.modelchecking
net.automatalib.ts	This package (including sub-packages) contains the basic classes concerning transition systems.
net.automatalib.ts.modal

Uses of FiniteRepresentation in net.automatalib.automaton

Subinterfaces of FiniteRepresentation 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.
static interface	DeterministicAutomaton.FullIntAbstraction<T>	Interface for full integer abstractions of a DeterministicAutomaton.
static interface	DeterministicAutomaton.IntAbstraction<T>	Base interface for integer abstractions of a DeterministicAutomaton.
static interface	DeterministicAutomaton.StateIntAbstraction<I,T>	Interface for state integer abstractions of a DeterministicAutomaton.
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.
static interface	MutableDeterministic.FullIntAbstraction<T,SP,TP>	Interface for full integer abstractions of a MutableDeterministic.
static interface	MutableDeterministic.IntAbstraction<T,SP,TP>	Base interface for integer abstractions of a MutableDeterministic.
static interface	MutableDeterministic.StateIntAbstraction<I,T,SP,TP>	Interface for state integer abstractions of a MutableDeterministic.
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.
static interface	UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>	Interface for full integer abstractions of a UniversalDeterministicAutomaton.
static interface	UniversalDeterministicAutomaton.IntAbstraction<T,SP,TP>	Base interface for integer abstractions of a UniversalDeterministicAutomaton.
static interface	UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>	Interface for state integer abstractions of a UniversalDeterministicAutomaton.
interface	UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>

Uses of FiniteRepresentation in net.automatalib.automaton.abstraction

Classes in net.automatalib.automaton.abstraction that implement FiniteRepresentation

Modifier and Type	Class	Description
static class	DeterministicAbstractions.FullIntAbstraction<I,T,A extends DeterministicAutomaton.StateIntAbstraction<I,T>>
static class	DeterministicAbstractions.StateIntAbstraction<S,I,T,A extends DeterministicAutomaton<S,I,T>>
static class	MutableDeterministicAbstraction.FullIntAbstraction<I,T,SP,TP,A extends MutableDeterministic.StateIntAbstraction<I,T,SP,TP>>
static class	MutableDeterministicAbstraction.StateIntAbstraction<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>>
static class	SimpleDeterministicAbstractions.FullIntAbstraction<I,A extends SimpleDeterministicAutomaton.StateIntAbstraction<I>>	Base class implementing the default way of obtaining a SimpleDeterministicAbstractions.FullIntAbstraction, i.e., building on top of a SimpleDeterministicAbstractions.StateIntAbstraction and a mapping from integers to (concrete) input symbols.
static class	SimpleDeterministicAbstractions.IntAbstraction<S,A extends SimpleDeterministicAutomaton<S,?>>	Base class implementing the default way of obtaining an integer abstraction from an automaton, i.e., by mapping states to integers and vice versa using the StateIDs mapping obtained via SimpleAutomaton.stateIDs().
static class	SimpleDeterministicAbstractions.StateIntAbstraction<S,I,A extends SimpleDeterministicAutomaton<S,I>>	Base class implementing the default way of obtaining a SimpleDeterministicAutomaton.StateIntAbstraction.
static class	UniversalDeterministicAbstractions.FullIntAbstraction<I,T,SP,TP,A extends UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>>
static class	UniversalDeterministicAbstractions.StateIntAbstraction<S,I,T,SP,TP,A extends UniversalDeterministicAutomaton<S,I,T,SP,TP>>

Uses of FiniteRepresentation in net.automatalib.automaton.concept

Subinterfaces of FiniteRepresentation 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 FiniteRepresentation in net.automatalib.automaton.fsa

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

Modifier and Type	Class	Description
static class	FiniteStateAcceptor.FSAGraphView<S,I,A extends FiniteStateAcceptor<S,I>>

Uses of FiniteRepresentation in net.automatalib.automaton.graph

Classes in net.automatalib.automaton.graph that implement FiniteRepresentation

Modifier and Type	Class	Description
class	AbstractAutomatonGraphView<S,A extends Automaton<S,?,?>,E>
class	AutomatonGraphView<S,I,T,A extends Automaton<S,I,T>>
class	UniversalAutomatonGraphView<S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>>

Uses of FiniteRepresentation in net.automatalib.automaton.procedural

Subinterfaces of FiniteRepresentation in net.automatalib.automaton.procedural

Modifier and Type	Interface	Description
(package private) interface	net.automatalib.automaton.procedural.ProceduralSystem<I,M extends UniversalDeterministicAutomaton<?,I,?,?,?>>	(Meta-) Interface for procedural systems, i.e., systems that consist of multiple procedural automata that can mutually call each other.
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 FiniteRepresentation

Modifier and Type	Class	Description
class	ProceduralGraphView<S,I>	Graph representation of a ProceduralSystem that displays all states of its sub-procedures once, i.e., without incorporating execution semantics such as stack contents.

Uses of FiniteRepresentation in net.automatalib.automaton.simple

Subinterfaces of FiniteRepresentation in net.automatalib.automaton.simple

Modifier and Type	Interface	Description
interface	SimpleAutomaton<S,I>	A simple automaton, i.e., a SimpleTS with a finite number of states.
interface	SimpleDeterministicAutomaton<S,I>	A simple deterministic automaton.
static interface	SimpleDeterministicAutomaton.FullIntAbstraction	Interface for an integer abstraction that abstracts both states and input symbols to integers.
static interface	SimpleDeterministicAutomaton.IntAbstraction	Basic interface for integer abstractions of automata.
static interface	SimpleDeterministicAutomaton.StateIntAbstraction<I>	Interface for integer abstractions of an automaton that operate on non-abstracted input symbols (i.e., input symbols are of type I).

Uses of FiniteRepresentation in net.automatalib.automaton.transducer

Subinterfaces of FiniteRepresentation 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	StateOutputAutomaton<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.
interface	TransitionOutputAutomaton<S,I,T,O>

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

Modifier and Type	Class	Description
static class	MealyMachine.MealyGraphView<S,I,T,O,A extends MealyMachine<S,I,T,O>>
static class	MooreMachine.MooreGraphView<S,I,T,O,A extends MooreMachine<S,I,T,O>>
static class	SubsequentialTransducer.SSTGraphView<S,I,T,O,A extends SubsequentialTransducer<S,I,T,O>>

Uses of FiniteRepresentation in net.automatalib.automaton.transducer.probabilistic

Subinterfaces of FiniteRepresentation in net.automatalib.automaton.transducer.probabilistic

Modifier and Type	Interface	Description
interface	MutableProbabilisticMealy<S,I,T,O>
interface	ProbabilisticMealyMachine<S,I,T,O>

Uses of FiniteRepresentation in net.automatalib.automaton.vpa

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

Modifier and Type	Class	Description
class	SEVPAGraphView<L,I>

Uses of FiniteRepresentation in net.automatalib.graph

Subinterfaces of FiniteRepresentation in net.automatalib.graph

Modifier and Type	Interface	Description
interface	AcceptanceGraph<N,E>	Interface for finite graphs that embody the concept of node acceptance.
interface	BidirectionalGraph<N,E>	Interface for bidirectional graph.
static interface	BidirectionalGraph.IntAbstraction<E>	Interface for node integer abstractions of a BidirectionalGraph.
interface	ContextFreeModalProcessSystem<L,AP>	Represents a Context-Free Modal Transition System as defined in the paper M3C: Modal Meta Model Checking.
interface	FiniteKripkeStructure<N,E,AP>	A Kripke structure is a graph which has sets of atomic properties assigned to its nodes.
interface	FiniteLabeledGraph<N,E,L>
interface	Graph<N,E>	Graph interface.
static interface	Graph.IntAbstraction<E>	Interface for node integer abstractions of a Graph.
interface	MutableGraph<N,E,NP,EP>	A graph that allows modification.
static interface	MutableGraph.IntAbstraction<E,NP,EP>	Interface for node integer abstractions of a MutableGraph.
interface	MutableProceduralModalProcessGraph<N,L,E,AP,TP extends MutableProceduralModalEdgeProperty>	A mutable version of the ProceduralModalProcessGraph.
interface	MutableUniversalBidirectionalGraph<N,E,NP,EP>
interface	ProceduralModalProcessGraph<N,L,E,AP,TP extends ProceduralModalEdgeProperty>	Represents a Procedural Modal Transition System as defined in the paper M3C: Modal Meta Model Checking.
interface	ShrinkableGraph<N,E>	A graph that supports (desirably efficient) removal of nodes and edges.
interface	SimpleGraph<N>	The finite version of a IndefiniteSimpleGraph.
static interface	SimpleGraph.IntAbstraction	Basic interface for integer abstractions of graphs.
interface	UndirectedGraph<N,E>	An undirected graph.
interface	UniversalBidirectionalGraph<N,E,NP,EP>
interface	UniversalGraph<N,E,NP,EP>
static interface	UniversalGraph.IntAbstraction<E,NP,EP>	Interface for node integer abstractions of a UniversalGraph.

Classes in net.automatalib.graph that implement FiniteRepresentation

Modifier and Type	Class	Description
class	CFMPSGraphView<N,L,E,AP>	Graph representation of a ContextFreeModalProcessSystem that displays all nodes of its sub-procedures once, i.e., without incorporating execution semantics such as expansion.

Uses of FiniteRepresentation in net.automatalib.graph.ads

Subinterfaces of FiniteRepresentation in net.automatalib.graph.ads

Modifier and Type	Interface	Description
interface	ADSNode<S,I,O>	A (simplified) node in an adaptive distinguishing sequence.
interface	RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>	An interface representing a node in an adaptive distinguishing sequence (which essentially forms a decision tree).

Uses of FiniteRepresentation in net.automatalib.modelchecking

Subinterfaces of FiniteRepresentation 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 for DFAs.
static interface	Lasso.MealyLasso<I,O>	A MealyLasso is a lasso for MealyMachines.

Uses of FiniteRepresentation in net.automatalib.ts

Subinterfaces of FiniteRepresentation in net.automatalib.ts

Modifier and Type	Interface	Description
interface	FiniteKTS<S,I,T,AP>	A finite Kripke Transition System combines the properties of a finite transition system and a KripkeInterpretation.

Uses of FiniteRepresentation in net.automatalib.ts.modal

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

Modifier and Type	Class	Description
static class	ModalTransitionSystem.MTSGraphView<S,I,T,TP extends ModalEdgeProperty,M extends ModalTransitionSystem<S,I,T,TP>>