Package | Description |
---|---|
net.automatalib.automata |
This package contains the basic interfaces for automata.
|
net.automatalib.automata.base.compact | |
net.automatalib.automata.fsa.impl.compact | |
net.automatalib.automata.simple | |
net.automatalib.automata.transducers.impl.compact | |
net.automatalib.util.partitionrefinement |
Modifier and Type | Interface and Description |
---|---|
static interface |
DeterministicAutomaton.FullIntAbstraction<T>
Interface for
full integer abstractions of a DeterministicAutomaton . |
static interface |
MutableDeterministic.FullIntAbstraction<T,SP,TP> |
static interface |
UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>
Interface for
full integer abstractions of a UniversalDeterministicAutomaton . |
Modifier and Type | Class and Description |
---|---|
static class |
DeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,T,A extends DeterministicAutomaton.StateIntAbstraction<I,T>> |
static class |
MutableDeterministic.FullIntAbstraction.DefaultAbstraction<I,T,SP,TP,A extends MutableDeterministic.StateIntAbstraction<I,T,SP,TP>> |
static class |
UniversalDeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,T,SP,TP,A extends UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>> |
Modifier and Type | Class and Description |
---|---|
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 |
UniversalCompactSimpleDet<I,SP>
A
AbstractCompactSimpleDeterministic -based implementation for automata that need to store generic state
properties. |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
Modifier and Type | Class and Description |
---|---|
static class |
SimpleDeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,A extends SimpleDeterministicAutomaton.StateIntAbstraction<I>>
Base class implementing the default way of obtaining a
SimpleDeterministicAutomaton.FullIntAbstraction , i.e., building on top of a
SimpleDeterministicAutomaton.StateIntAbstraction and a mapping from integers to (concrete) input symbols. |
Modifier and Type | Method and Description |
---|---|
default SimpleDeterministicAutomaton.FullIntAbstraction |
SimpleDeterministicAutomaton.fullIntAbstraction(Alphabet<I> alphabet)
Retrieves a
SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the mapping induced by the given alphabet as the
abstraction for the input symbols. |
default SimpleDeterministicAutomaton.FullIntAbstraction |
SimpleDeterministicAutomaton.fullIntAbstraction(int numInputs,
IntFunction<? extends I> symMapping)
Retrieves a
SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the given number of (abstract) inputs and the
inputs mapping. |
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
class |
CompactMoore<I,O> |
Modifier and Type | Method and Description |
---|---|
static void |
PaigeTarjanInitializers.initCompleteDeterministic(PaigeTarjan pt,
SimpleDeterministicAutomaton.FullIntAbstraction absAutomaton,
IntFunction<?> initialClassification,
boolean pruneUnreachable)
Initializes the partition refinement data structure from a given abstracted deterministic automaton, partitioning
states according to the given classification function.
|
static void |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
SimpleDeterministicAutomaton.FullIntAbstraction absAutomaton,
IntFunction<?> initialClassification,
Object sinkClassification)
Initializes the partition refinement data structure from a given deterministic automaton, initializing the
initial partition according to the given classification function.
|
static <I,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
SimpleDeterministicAutomaton.FullIntAbstraction absOriginal,
IntFunction<? extends SP> spExtractor,
BiIntFunction<? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
Copyright © 2020. All rights reserved.