Package | Description |
---|---|
net.automatalib.util.partitionrefinement |
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.initCompleteDeterministic(PaigeTarjan pt,
UniversalDeterministicAutomaton.FullIntAbstraction<?,?,?> absAutomaton,
PaigeTarjanInitializers.AutomatonInitialPartitioning ip,
boolean pruneUnreachable)
Initializes the partition refinement data structure from a given abstracted
deterministic automaton, using a predefined initial partitioning mode.
|
static <S,I,T> StateIDs<S> |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
DeterministicAutomaton<S,I,T> automaton,
Alphabet<I> inputs,
Predicate<? super S> initialClassification,
boolean sinkClassification)
Initializes the partition refinement data structure from a given
deterministic automaton, initializing the initial partition according
to the given classification predicate (i.e., assuming a binary initial
partitioning).
|
static <S,I> StateIDs<S> |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
SimpleDeterministicAutomaton<S,I> automaton,
Alphabet<I> inputs,
Function<? super S,?> 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,T,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
DeterministicAutomaton.FullIntAbstraction<T> absOriginal,
IntFunction<? extends SP> spExtractor,
Function<? super T,? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
static <S1,S2,I,T1,T2,SP,TP,A extends MutableDeterministic<S2,I,T2,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
DeterministicAutomaton<S1,I,T1> original,
StateIDs<S1> origIds,
Function<? super S1,? extends SP> spExtractor,
Function<? super T1,? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
Copyright © 2015. All rights reserved.