Uses of Interface
net.automatalib.automaton.concept.FiniteRepresentation
-
-
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 forfull integer abstractions
of aDeterministicAutomaton
.static interface
DeterministicAutomaton.IntAbstraction<T>
Base interface forinteger abstractions
of aDeterministicAutomaton
.static interface
DeterministicAutomaton.StateIntAbstraction<I,T>
Interface forstate integer abstractions
of aDeterministicAutomaton
.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 forfull integer abstractions
of aMutableDeterministic
.static interface
MutableDeterministic.IntAbstraction<T,SP,TP>
Base interface forinteger abstractions
of aMutableDeterministic
.static interface
MutableDeterministic.StateIntAbstraction<I,T,SP,TP>
Interface forstate integer abstractions
of aMutableDeterministic
.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.static interface
UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>
Interface forfull integer abstractions
of aUniversalDeterministicAutomaton
.static interface
UniversalDeterministicAutomaton.IntAbstraction<T,SP,TP>
Base interface forinteger abstractions
of aUniversalDeterministicAutomaton
.static interface
UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>
Interface forstate integer abstractions
of aUniversalDeterministicAutomaton
.interface
UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>
Classes in net.automatalib.automaton that implement FiniteRepresentation 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 FiniteRepresentation in net.automatalib.automaton.abstraction
-
Uses of FiniteRepresentation in net.automatalib.automaton.base
Classes in net.automatalib.automaton.base that implement FiniteRepresentation 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 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>
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 FiniteRepresentation Modifier and Type Class Description class
CompactDFA<I>
class
CompactNFA<I>
class
FastDFA<I>
class
FastNFA<I>
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
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
ProceduralGraphView<S,I>
Graph representation of aProceduralSystem
that displays all states of its sub-procedures once, i.e., without incorporating execution semantics such as stack contents.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 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., aSimpleTS
with a finite number of states.interface
SimpleDeterministicAutomaton<S,I>
A simple deterministic automaton.static interface
SimpleDeterministicAutomaton.FullIntAbstraction
Interface for aninteger 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 forinteger abstractions
of an automaton that operate on non-abstracted input symbols (i.e., input symbols are of typeI
). -
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>
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 FiniteRepresentation 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.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>
Classes in net.automatalib.automaton.transducer.probabilistic that implement FiniteRepresentation Modifier and Type Class Description class
FastProbMealy<I,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
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.class
SEVPAGraphView<L,I>
-
Uses of FiniteRepresentation in net.automatalib.brics
Classes in net.automatalib.brics that implement FiniteRepresentation Modifier and Type Class Description class
AbstractBricsAutomaton
Base class for Brics automata adapters.class
AbstractBricsAutomaton.GraphView
class
BricsDFA
Adapter class for wrapping a Brics automaton as aDFA
.class
BricsNFA
Adapter class for wrapping a Brics automaton as anNFA
. -
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 fornode integer abstractions
of aBidirectionalGraph
.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 fornode integer abstractions
of aGraph
.interface
MutableGraph<N,E,NP,EP>
A graph that allows modification.static interface
MutableGraph.IntAbstraction<E,NP,EP>
Interface fornode integer abstractions
of aMutableGraph
.interface
MutableProceduralModalProcessGraph<N,L,E,AP,TP extends MutableProceduralModalEdgeProperty>
A mutable version of theProceduralModalProcessGraph
.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 aIndefiniteSimpleGraph
.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 fornode integer abstractions
of aUniversalGraph
.Classes in net.automatalib.graph that implement FiniteRepresentation Modifier and Type Class Description class
CFMPSGraphView<N,L,E,AP>
Graph representation of aContextFreeModalProcessSystem
that displays all nodes of its sub-procedures once, i.e., without incorporating execution semantics such as expansion.class
CompactBidiGraph<NP,EP>
class
CompactGraph<NP,EP>
class
CompactPMPG<L,AP>
class
CompactSimpleBidiGraph<EP>
class
CompactSimpleGraph<EP>
class
DefaultCFMPS<L,AP>
class
SimpleMapGraph<N>
A very simple graph realization, where nodes can be arbitrary Java objects. -
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).Classes in net.automatalib.graph.ads that implement FiniteRepresentation Modifier and Type Class Description class
AbstractRecursiveADSLeafNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>
An abstract implementation of a leaf node, that may be used by other ADS-extending classes.class
AbstractRecursiveADSSymbolNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>
An abstract implementation of a symbol node, that may be used by other ADS-extending classes.class
ADSLeafNode<S,I,O>
An ADS-specific implementation of a leaf node.class
ADSSymbolNode<S,I,O>
An ADS-specific implementation of a symbol node. -
Uses of FiniteRepresentation in net.automatalib.graph.base
Classes in net.automatalib.graph.base that implement FiniteRepresentation Modifier and Type Class Description class
AbstractCompactBidiGraph<NP,EP>
class
AbstractCompactGraph<E extends CompactEdge<EP>,NP,EP>
-
Uses of FiniteRepresentation in net.automatalib.modelchecker.m3c.solver
Classes in net.automatalib.modelchecker.m3c.solver that implement FiniteRepresentation Modifier and Type Class Description class
WitnessTree<L,AP>
A tree-likeGraph
that represents the BFS-style exploration of the tableau generated by theWitnessTreeExtractor
. -
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 forDFA
s.static interface
Lasso.MealyLasso<I,O>
A MealyLasso is a lasso forMealyMachine
s.Classes in net.automatalib.modelchecking that implement FiniteRepresentation 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 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 afinite transition system
and aKripkeInterpretation
. -
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 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 FiniteRepresentation Modifier and Type Class Description class
AbstractCompactMTS<I,T,TP extends MutableModalEdgeProperty>
An abstract base-implementation forMutableModalTransitionSystem
s.class
CompactMTS<I>
static class
ModalTransitionSystem.MTSGraphView<S,I,T,TP extends ModalEdgeProperty,M extends ModalTransitionSystem<S,I,T,TP>>
-
Uses of FiniteRepresentation in net.automatalib.util.automaton.vpa
Classes in net.automatalib.util.automaton.vpa that implement FiniteRepresentation Modifier and Type Class Description class
ProductOneSEVPA<L1,L2,I>
Production automaton that allows to join two givenOneSEVPA
s.
-