A B C D E F G H I L M N O P R S T U V W X
All Classes All Packages
All Classes All Packages
All Classes All Packages
A
- ABORT_INPUT - net.automatalib.util.ts.traversal.TSTraversalAction
-
Abort the exploration of the current input symbol.
- ABORT_NODE - net.automatalib.util.graph.traversal.GraphTraversalAction
-
Abort the exploration of the current node.
- ABORT_STATE - net.automatalib.util.ts.traversal.TSTraversalAction
-
Abort the exploration of the current state.
- ABORT_TRAVERSAL - net.automatalib.util.graph.traversal.GraphTraversalAction
-
Abort the traversal of the whole graph.
- ABORT_TRAVERSAL - net.automatalib.util.ts.traversal.TSTraversalAction
-
Abort the traversal of the whole graph.
- AbstractLowLevelAutomatonCopier<S1,I1,T1,S2,I2,T2,SP2,TP2,TS1 extends TransitionSystem<S1,? super I1,T1>> - Class in net.automatalib.util.automaton.copy
- AbstractLowLevelAutomatonCopier(TS1, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Constructor for class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- acceptance(AcceptorTS<S, ?>) - Static method in class net.automatalib.util.ts.acceptor.Acceptors
- AcceptanceCombiner - Interface in net.automatalib.util.ts.acceptor
- Acceptors - Class in net.automatalib.util.ts.acceptor
- acceptsEmptyLanguage(DFA<S, ?>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Computes whether the given
DFA
accepts the empty language. - accessSequences - Variable in class net.automatalib.util.automaton.procedural.ATRSequences
- accessSequences - Variable in class net.automatalib.util.automaton.procedural.ATSequences
- addStates(int) - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- addTransitions() - Method in class net.automatalib.util.automaton.random.RandomDeterministicAutomatonGenerator
- ADS - Class in net.automatalib.util.automaton.ads
-
General purpose facade for computing adaptive distinguishing sequences.
- ADSUtil - Class in net.automatalib.util.automaton.ads
-
Utility class, that offers some operations revolving around adaptive distinguishing sequences.
- allDefinedInputs(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
- allDefinedInputs(TransitionSystem<S, I, ?>, Iterable<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
- allDefinedInputsIterator(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
- allDefinedInputsIterator(TransitionSystem<S, I, ?>, Iterator<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
- AllDefinedInputsIterator<S,I> - Class in net.automatalib.util.ts.iterator
- AllDefinedInputsIterator(Iterator<? extends S>, TransitionSystem<S, I, ?>, Iterable<? extends I>) - Constructor for class net.automatalib.util.ts.iterator.AllDefinedInputsIterator
- allowPartial - Variable in class net.automatalib.util.ts.comp.DTSComposition
- allUndefinedInputs(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
- allUndefinedInputsIterator(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
- AllUndefinedInputsIterator<S,I> - Class in net.automatalib.util.ts.iterator
- AllUndefinedInputsIterator(Iterator<? extends S>, TransitionSystem<S, I, ?>, Iterable<? extends I>) - Constructor for class net.automatalib.util.ts.iterator.AllUndefinedInputsIterator
- allUndefinedTransitions(TransitionSystem<S, I, ?>, Iterable<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
- allUndefinedTransitionsIterator(TransitionSystem<S, I, ?>, Iterator<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
- alwaysFalse() - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- alwaysTrue() - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- and(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the conjunction ("and") of two DFA, and stores the result in a given mutable DFA.
- and(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the conjunction ("and") of two DFA, and returns the result as a new DFA.
- and(NFA<?, I>, NFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the conjunction ("and") of two NFAs, and stores the result in a given mutable NFA.
- and(NFA<?, I>, NFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the conjunction ("and") of two NFAs, and returns the result as a new NFA.
- and(OneSEVPA<L1, I>, OneSEVPA<L2, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Returns a view on the conjunction ("and") of two
OneSEVPA
s. - AND - Static variable in interface net.automatalib.util.ts.acceptor.AcceptanceCombiner
- APSPResult<N,E> - Interface in net.automatalib.util.graph.apsp
-
Result interface for the all pairs shortest paths problem.
- asBlockAutomaton() - Method in class net.automatalib.util.minimizer.MinimizationResult
-
Creates a
BlockAutomaton
using this results structure. - asGraph(Automaton<S, I, T>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
- ATRSequences<I> - Class in net.automatalib.util.automaton.procedural
-
A data class for aggregating access sequences, terminating sequences, and return sequences.
- ATRSequences(Map<I, Word<I>>, Map<I, Word<I>>, Map<I, Word<I>>) - Constructor for class net.automatalib.util.automaton.procedural.ATRSequences
- ATSequences<I> - Class in net.automatalib.util.automaton.procedural
-
A data class for aggregating access sequences and terminating sequences.
- ATSequences(Map<I, Word<I>>, Map<I, Word<I>>) - Constructor for class net.automatalib.util.automaton.procedural.ATSequences
- Automata - Class in net.automatalib.util.automaton
- automaton - Variable in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- AutomatonBuilder<S,I,T,SP,TP,A extends MutableAutomaton<S,? super I,T,? super SP,? super TP>> - Class in net.automatalib.util.automaton.builder
- AutomatonBuilder(A) - Constructor for class net.automatalib.util.automaton.builder.AutomatonBuilder
- AutomatonBuilder__0() - Constructor for class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__0
- AutomatonBuilder__1() - Constructor for class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__1
- AutomatonBuilder__2() - Constructor for class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- AutomatonBuilder__3() - Constructor for class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__3
- AutomatonBuilder.AutomatonBuilder__0 - Class in net.automatalib.util.automaton.builder
- AutomatonBuilder.AutomatonBuilder__1 - Class in net.automatalib.util.automaton.builder
- AutomatonBuilder.AutomatonBuilder__2 - Class in net.automatalib.util.automaton.builder
- AutomatonBuilder.AutomatonBuilder__3 - Class in net.automatalib.util.automaton.builder
- AutomatonBuilders - Class in net.automatalib.util.automaton.builder
-
Fluent interface automaton builders.
- AutomatonCopyMethod - Interface in net.automatalib.util.automaton.copy
- AutomatonInitialPartitioning - Enum in net.automatalib.util.partitionrefinement
-
This enum allows to conveniently specify how the states of a deterministic automaton are initially partitioned when initializing the partition refinement data structure.
- AutomatonLowLevelCopy - Class in net.automatalib.util.automaton.copy
B
- backtrackEdge(N, D, E, N, D) - Method in interface net.automatalib.util.graph.traversal.GraphTraversalVisitor
-
Called when an edge is backtracked.
- backtrackEdge(N, TarjanSCCRecord, E, N, TarjanSCCRecord) - Method in class net.automatalib.util.graph.scc.TarjanSCCVisitor
- BacktrackingSearch - Class in net.automatalib.util.automaton.ads
-
A class containing methods for computing adaptive distinguishing sequences (for arbitrary sets of states) by means of a backtracking approach.
- BacktrackingSearch.CostAggregator - Enum in net.automatalib.util.automaton.ads
-
Utility enum, that allows to specify the optimization criterion when performing and optimal ADS search.
- backtrackTransition(S, D, I, T, S, D) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor
-
Called when an edge is backtracked.
- BFS - Static variable in interface net.automatalib.util.automaton.copy.AutomatonCopyMethod
- Bisimulation - Class in net.automatalib.util.automaton.equivalence
- bisimulationEquivalenceRelation(A, B, Collection<I>) - Static method in class net.automatalib.util.automaton.equivalence.Bisimulation
- Block<S,L> - Class in net.automatalib.util.minimizer
-
A block in the partition calculated during minimization.
- Block - Class in net.automatalib.util.partitionrefinement
-
A block (i.e., partition class) that is maintained during the Paige/Tarjan partition refinement algorithm (see
PaigeTarjan
). - Block(int, int, int, Block) - Constructor for class net.automatalib.util.partitionrefinement.Block
-
Constructor.
- BlockAutomaton<S,L> - Class in net.automatalib.util.minimizer
-
A "block automaton", i.e. an automaton-style representation of the minimization result in which each block forms a state.
- blockData - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The array storing the raw block data, i.e., the states contained in a certain block.
- BlockEdge<S,L> - Class in net.automatalib.util.minimizer
-
An edge in a
BlockAutomaton
. - blockForState - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The array mapping states (in the range between
0
andPaigeTarjan.numStates
) to their containing block. - blockList() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Retrieves an
Iterable
that provides the iterator returned byPaigeTarjan.blockListIterator()
. - blockListIterator() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Retrieves an iterator for iterating over all blocks in the block list.
- BlockMap<V> - Class in net.automatalib.util.minimizer
-
Class for associating arbitrary values with the blocks of a minimization result.
- BlockMap(MinimizationResult<?, ?>) - Constructor for class net.automatalib.util.minimizer.BlockMap
-
Constructor.
- BREADTH_FIRST - net.automatalib.util.traversal.TraversalOrder
- BREADTH_FIRST - Static variable in interface net.automatalib.util.ts.traversal.TSTraversalMethod
- breadthFirst(IndefiniteGraph<N, E>, int, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a breadth-first fashion.
- breadthFirst(IndefiniteGraph<N, E>, int, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a breadth-first fashion.
- breadthFirst(IndefiniteGraph<N, E>, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a breadth-first fashion.
- breadthFirst(IndefiniteGraph<N, E>, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a breadth-first fashion.
- breadthFirst(TransitionSystem<S, ? super I, T>, int, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Traverses the given transition system in a breadth-first fashion.
- breadthFirst(TransitionSystem<S, ? super I, T>, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Traverses the given transition system in a breadth-first fashion.
- breadthFirstIterator(IndefiniteGraph<N, E>, Collection<? extends N>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Returns an
Iterator
for the (reachable) nodes of the given graph in breadth-first order. - breadthFirstIterator(TransitionSystem<S, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Returns an
Iterator
for the (reachable) states of the given transition system in breadth-first order. - breadthFirstOrder(IndefiniteGraph<N, E>, Collection<? extends N>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Returns an
Iterable
for the (reachable) nodes of the given graph in breadth-first order. - breadthFirstOrder(TransitionSystem<S, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Returns an
Iterable
for the (reachable) states of the given transition system in breadth-first order. - buildFromTrace(MealyMachine<S, I, T, O>, Word<I>, S) - Static method in class net.automatalib.util.automaton.ads.ADSUtil
- buildTraceForNode(ADSNode<S, I, O>) - Static method in class net.automatalib.util.automaton.ads.ADSUtil
- BY_FULL_SIGNATURE - net.automatalib.util.partitionrefinement.AutomatonInitialPartitioning
-
States are initially partitioned by both their state properties and their transition properties.
- BY_STATE_PROPERTY - net.automatalib.util.partitionrefinement.AutomatonInitialPartitioning
-
States are initially partitioned by their state property, i.e., states with the same state property are initially placed in the same partition class.
- BY_TRANSITION_PROPERTIES - net.automatalib.util.partitionrefinement.AutomatonInitialPartitioning
-
States are initially partitioned by all of their transition properties, i.e., states with the same input symbol/transition property combinations are initially placed in the same partition class.
- byFullSignature(UniversalDeterministicAutomaton.FullIntAbstraction<?, ?, ?>, int) - Static method in class net.automatalib.util.partitionrefinement.StateSignature
- byFullSignature(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Alphabet<I>, S) - Static method in class net.automatalib.util.partitionrefinement.StateSignature
- byFullSignature(SP, TP...) - Static method in class net.automatalib.util.partitionrefinement.StateSignature
- byTransitionProperties(UniversalDeterministicAutomaton.FullIntAbstraction<?, ?, ?>, int) - Static method in class net.automatalib.util.partitionrefinement.StateSignature
- byTransitionProperties(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Alphabet<I>, S) - Static method in class net.automatalib.util.partitionrefinement.StateSignature
- byTransitionProperties(TP...) - Static method in class net.automatalib.util.partitionrefinement.StateSignature
C
- canonizeBlocks() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Iterates over the current
block list
and sets every block'slow
andhigh
pointer to the accumulated sum of its own high pointer and its preceding blocks' high pointers, effectively reducing each block to a single representative padded by its previous range. - characterizingSet(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
-
Computes a characterizing set, and returns it as a
List
. - characterizingSet(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.Automata
-
Computes a characterizing set for the given automaton.
- characterizingSetIterator(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.equivalence.CharacterizingSets
- CharacterizingSets - Class in net.automatalib.util.automaton.equivalence
-
Operations for calculating characterizing sets.
- chooseInitial() - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- chooseInitials(int) - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- collectLeaves(ADSNode<S, I, O>) - Static method in class net.automatalib.util.automaton.ads.ADSUtil
- collectSCCs(Graph<N, E>) - Static method in class net.automatalib.util.graph.Graphs
-
Collects all strongly-connected components in a graph.
- collectSCCs(Graph<N, E>) - Static method in class net.automatalib.util.graph.scc.SCCs
-
Collects all strongly-connected components in a graph.
- combine(boolean, boolean) - Method in interface net.automatalib.util.ts.acceptor.AcceptanceCombiner
-
Combine two acceptance values.
- combine(I, Word<I>) - Method in class net.automatalib.util.automaton.conformance.SPATestsIterator
- combine(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A, AcceptanceCombiner) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Most general way of combining two DFAs.
- combine(DFA<?, I>, DFA<?, I>, Alphabet<I>, AcceptanceCombiner) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Most general way of combining two DFAs.
- combine(NFA<?, I>, NFA<?, I>, Collection<? extends I>, A, AcceptanceCombiner) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Most general way of combining two NFAs.
- combine(NFA<?, I>, NFA<?, I>, Alphabet<I>, AcceptanceCombiner) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Most general way of combining two NFAs.
- combine(MealyMachine<?, I, ?, O1>, MealyMachine<?, I, ?, O2>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.transducer.MealyMachines
-
Constructs the product automaton for two Mealy Machines.
- combine(MealyMachine<?, I, ?, O1>, MealyMachine<?, I, ?, O2>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.transducer.MealyMachines
-
Constructs the product automaton for two Mealy Machines.
- combine(OneSEVPA<L1, I>, OneSEVPA<L2, I>, VPAlphabet<I>, AcceptanceCombiner) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Most general way of combining two
OneSEVPA
s. - combine(Word<I>, List<I>, Word<I>) - Method in class net.automatalib.util.automaton.conformance.WMethodTestsIterator
- combine(S, I) - Method in class net.automatalib.util.ts.iterator.AllDefinedInputsIterator
- combine(S, I) - Method in class net.automatalib.util.ts.iterator.AllUndefinedInputsIterator
- combine(TS1, TS2) - Static method in class net.automatalib.util.ts.transducer.Transducers
- combine(TS1, TS2, AcceptanceCombiner) - Static method in class net.automatalib.util.ts.acceptor.Acceptors
- complement(DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the complement (negation) of a DFA, and stores the result in a given mutable DFA.
- complement(DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the complement (negation) of a DFA, and returns the result as a new DFA.
- complement(MutableDFA<?, I>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.fsa.MutableDFAs
- complete(DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.DFAs
- complete(DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
- complete(MutableDFA<?, I>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.fsa.MutableDFAs
- complete(MutableDFA<?, I>, Collection<? extends I>, boolean) - Static method in class net.automatalib.util.automaton.fsa.MutableDFAs
- complete(MutableDFA<S, I>, Collection<? extends I>, boolean, boolean) - Static method in class net.automatalib.util.automaton.fsa.MutableDFAs
- complete(MealyMachine<?, I, ?, O>, Collection<? extends I>, O, A) - Static method in class net.automatalib.util.automaton.transducer.MealyMachines
-
Constructs a copy of the given Mealy machine in which every transition (in regard to the specified alphabet) is guaranteed to be defined.
- complete(MealyMachine<?, I, ?, O>, Alphabet<I>, O) - Static method in class net.automatalib.util.automaton.transducer.MealyMachines
-
Constructs a copy of the given Mealy machine in which every transition (in regard to the specified alphabet) is guaranteed to be defined.
- complete(MutableMealyMachine<?, I, ?, O>, Collection<? extends I>, O) - Static method in class net.automatalib.util.automaton.transducer.MutableMealyMachines
- complete(MutableMealyMachine<S, I, ?, O>, Collection<? extends I>, O, boolean) - Static method in class net.automatalib.util.automaton.transducer.MutableMealyMachines
- compose(Predicate<? super S>, Predicate<? super I>, Predicate<? super T>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- compose(ModalTransitionSystem<S0, I, ?, ?>, ModalTransitionSystem<S1, I, ?, ?>) - Static method in class net.automatalib.util.ts.modal.MTSs
- compose(ModalTransitionSystem<S0, I, ?, ?>, ModalTransitionSystem<S1, I, ?, ?>, AutomatonCreator<A, I>) - Static method in class net.automatalib.util.ts.modal.MTSs
- compose(TS1, TS2) - Static method in class net.automatalib.util.ts.comp.TSCompositions
- composeWithMapping(ModalTransitionSystem<S0, I, ?, ?>, ModalTransitionSystem<S1, I, ?, ?>, AutomatonCreator<A, I>) - Static method in class net.automatalib.util.ts.modal.MTSs
- compute(MealyMachine<S, I, ?, O>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.ads.LeeYannakakis
-
Computes an ADS using the algorithm of Lee and Yannakakis.
- compute(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Static method in class net.automatalib.util.automaton.ads.ADS
-
Compute an adaptive distinguishing sequence for the given automaton and the given set of states.
- compute(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Static method in class net.automatalib.util.automaton.ads.BacktrackingSearch
-
Computes an ADS by constructing (growing) splitting words for the current set of states and recursively computing sub-ADSs for the induced partitions.
- compute(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>) - Static method in class net.automatalib.util.automaton.ads.StateEquivalence
-
Computes a two-state ADS by using
Automata.findSeparatingWord(UniversalDeterministicAutomaton, UniversalDeterministicAutomaton, Collection)
. - computeAccessAndReturnSequences(SPA<?, I>, ProceduralInputAlphabet<I>, Map<I, Word<I>>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
- computeAccessSequence(OneSEVPA<L, I>, VPAlphabet<I>, Predicate<? super L>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Computes an access sequence over the given alphabet (if existent) such that it reaches a location of the given SEVPA that satisfies the given predicate.
- computeAccessSequences(SBA<?, I>, ProceduralInputAlphabet<I>, Map<I, Word<I>>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
- computeAccessSequences(SPMM<?, I, ?, O>, ProceduralInputAlphabet<I>, Map<I, Word<I>>) - Static method in class net.automatalib.util.automaton.procedural.SPMMs
- computeAccessSequences(OneSEVPA<L, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Computes all access sequences over the given alphabet (if existent) to the locations of the given SEVPA.
- computeATRSequences(SPA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
-
Computes a set of access sequences, terminating sequences, and return sequences for a given
SPA
. - computeATRSequences(SPA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
-
Computes a set of access sequences, terminating sequences, and return sequences for a given
SPA
limited to the symbols of the givenProceduralInputAlphabet
. - computeATSequences(SBA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Computes a set of access sequences and terminating sequences for a given
SBA
. - computeATSequences(SBA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Computes a set of access sequences and terminating sequences for a given
SBA
limited to the symbols of the givenProceduralInputAlphabet
. - computeATSequences(SPMM<?, I, ?, O>) - Static method in class net.automatalib.util.automaton.procedural.SPMMs
-
Computes a set of access sequences and terminating sequences for a given
SPMM
. - computeATSequences(SPMM<?, I, ?, O>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPMMs
-
Computes a set of access sequences and return sequences for a given
SPMM
limited to the symbols of the givenProceduralInputAlphabet
. - computeCoarsestStablePartition() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Refines the partition until it stabilizes.
- computeLength(ADSNode<S, I, O>) - Static method in class net.automatalib.util.automaton.ads.ADSUtil
- computeMaximumSplittingWordLength(int, int, int) - Static method in class net.automatalib.util.automaton.ads.ADSUtil
-
Computes an upper bound for the length of a splitting word.
- computeNext() - Method in class net.automatalib.util.ts.iterator.DefinedInputsIterator
- computeNext() - Method in class net.automatalib.util.ts.iterator.UndefinedInputsIterator
- computeOptimal(MealyMachine<S, I, ?, O>, Alphabet<I>, Set<S>, BacktrackingSearch.CostAggregator) - Static method in class net.automatalib.util.automaton.ads.BacktrackingSearch
-
Computes an ADS by iterating over the successor tree in a breadth-first manner, yielding an optimal (dependent on the passed optimization function) ADS.
- computeTerminatingSequences(SBA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
- computeTerminatingSequences(SPA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
- computeTerminatingSequences(SPMM<?, I, ?, O>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPMMs
- conjunction(ModalTransitionSystem<S0, I, ?, ?>, ModalTransitionSystem<S1, I, ?, ?>) - Static method in class net.automatalib.util.ts.modal.MTSs
- conjunction(ModalTransitionSystem<S0, I, ?, ?>, ModalTransitionSystem<S1, I, ?, ?>, AutomatonCreator<A, I>) - Static method in class net.automatalib.util.ts.modal.MTSs
- conjunctionWithMapping(ModalTransitionSystem<S0, I, ?, ?>, ModalTransitionSystem<S1, I, ?, ?>, AutomatonCreator<A, I>) - Static method in class net.automatalib.util.ts.modal.MTSs
- constantValue(boolean) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I, T1, ? extends SP, ? extends TP>, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP, ? super TP>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies a
UniversalAutomaton
with compatible input alphabets and properties. - copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I, T1, ? extends SP, ? extends TP>, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP, ? super TP>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies a
UniversalAutomaton
with compatible input alphabets and properties. - copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I, T1, ? extends SP1, ? extends TP1>, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP2, ? super TP2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies a
UniversalAutomaton
to aMutableAutomaton
with compatible input alphabets, but possibly heterogeneous properties. - copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I, T1, ? extends SP1, ? extends TP1>, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP2, ? super TP2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies a
UniversalAutomaton
to aMutableAutomaton
with compatible input alphabets, but possibly heterogeneous properties. - copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I1, T1, ? extends SP, ? extends TP>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP, ? super TP>, Function<? super I1, ? extends I2>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies a
UniversalAutomaton
with possibly heterogeneous input alphabets, but compatible properties. - copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I1, T1, ? extends SP, ? extends TP>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP, ? super TP>, Function<? super I1, ? extends I2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies a
UniversalAutomaton
with possibly heterogeneous input alphabets, but compatible properties. - copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I1, T1, ? extends SP1, ? extends TP1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies a
UniversalAutomaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties. - copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I1, T1, ? extends SP1, ? extends TP1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies a
UniversalAutomaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties. - copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I, T1, ? extends SP, ? extends TP>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP, ? super TP>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies a
UniversalAutomaton
with compatible input alphabets and properties. - copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I, T1, ? extends SP, ? extends TP>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP, ? super TP>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies a
UniversalAutomaton
with compatible input alphabets and properties. - copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I, T1, ? extends SP1, ? extends TP1>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP2, ? super TP2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies a
UniversalAutomaton
to aMutableAutomaton
with compatible input alphabets, but possibly heterogeneous properties. - copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I, T1, ? extends SP1, ? extends TP1>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP2, ? super TP2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies a
UniversalAutomaton
to aMutableAutomaton
with compatible input alphabets, but possibly heterogeneous properties. - copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I1, T1, ? extends SP, ? extends TP>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP, ? super TP>, Function<? super I1, ? extends I2>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies a
UniversalAutomaton
with possibly heterogeneous input alphabets, but compatible properties. - copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I1, T1, ? extends SP, ? extends TP>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP, ? super TP>, Function<? super I1, ? extends I2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies a
UniversalAutomaton
with possibly heterogeneous input alphabets, but compatible properties. - copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I1, T1, ? extends SP1, ? extends TP1>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies a
UniversalAutomaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties. - copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I1, T1, ? extends SP1, ? extends TP1>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies a
UniversalAutomaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties. - copyInitialState(S1) - Method in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- copyPlain(Graph<N1, E1>, MutableGraph<N2, E2, NP2, EP2>, Mapping<? super N1, ? extends NP2>, Mapping<? super E1, ? extends EP2>) - Static method in class net.automatalib.util.graph.copy.GraphCopy
- copyPlain(UniversalGraph<N1, E1, ? extends NP2, ? extends EP2>, MutableGraph<N2, E2, NP2, EP2>) - Static method in class net.automatalib.util.graph.copy.GraphCopy
- copyState(S1) - Method in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- copyTransition(S2, I2, T1, S1) - Method in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- copyTransitionChecked(S2, I2, T1, S1) - Method in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- copyTransitions(S2, I2, Iterator<? extends T1>) - Method in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- copyTraversal(IndefiniteGraph<N1, E1>, MutableGraph<N2, E2, NP2, EP2>, TraversalOrder, int, Collection<? extends N1>, Mapping<? super N1, ? extends NP2>, Mapping<? super E1, ? extends EP2>) - Static method in class net.automatalib.util.graph.copy.GraphCopy
- copyTraversal(UniversalIndefiniteGraph<N1, E1, ? extends NP2, ? extends EP2>, MutableGraph<N2, E2, NP2, EP2>, TraversalOrder, int, Collection<? extends N1>) - Static method in class net.automatalib.util.graph.copy.GraphCopy
- copyUniversalPlain(UniversalGraph<N1, E1, NP1, EP1>, MutableGraph<N2, E2, NP2, EP2>, Mapping<? super NP1, ? extends NP2>, Mapping<? super EP1, ? extends EP2>) - Static method in class net.automatalib.util.graph.copy.GraphCopy
- copyUniversalTraversal(UniversalIndefiniteGraph<N1, E1, NP1, EP1>, MutableGraph<N2, E2, NP2, EP2>, TraversalOrder, int, Collection<? extends N1>, Mapping<? super NP1, ? extends NP2>, Mapping<? super EP1, ? extends EP2>) - Static method in class net.automatalib.util.graph.copy.GraphCopy
- countSymbolNodes(ADSNode<S, I, O>) - Static method in class net.automatalib.util.automaton.ads.ADSUtil
- cover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? super Word<I>>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Utility method that allows to compute a state and transition cover simultaneously.
- Covers - Class in net.automatalib.util.automaton.cover
- create() - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- create() - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder
- create() - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__1
- create() - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__6
- create() - Method in class net.automatalib.util.automaton.builder.FSABuilder
- create() - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- create() - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- create() - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__1
- create() - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__7
- create() - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__1
- create() - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__6
- createBlock() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Creates a new block.
- createBlockForStateMap() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Creates the
PaigeTarjan.blockForState
mapping from the blocks in the block list, and the contents of thePaigeTarjan.blockData
array. - createLowLevelCopier(Automaton<S1, ? super I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Method in interface net.automatalib.util.automaton.copy.AutomatonCopyMethod
D
- data - Variable in class net.automatalib.util.ts.traversal.DFRecord
- data - Variable in class net.automatalib.util.ts.traversal.DFRecord.LastTransition
- definedInputs(DeterministicTransitionSystem<S, I, ?>, S, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
- definedInputsIterator(TransitionSystem<S, I, ?>, S, Iterator<? extends I>) - Static method in class net.automatalib.util.ts.TS
- DefinedInputsIterator<S,I> - Class in net.automatalib.util.ts.iterator
- DefinedInputsIterator(TransitionSystem<S, I, ?>, S, Iterator<? extends I>) - Constructor for class net.automatalib.util.ts.iterator.DefinedInputsIterator
- delegate() - Method in class net.automatalib.util.automaton.conformance.WpMethodTestsIterator
- DEPTH_FIRST - net.automatalib.util.traversal.TraversalOrder
- DEPTH_FIRST - Static variable in interface net.automatalib.util.ts.traversal.TSTraversalMethod
- depthFirst(IndefiniteGraph<N, E>, int, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a breadth-first fashion.
- depthFirst(IndefiniteGraph<N, E>, int, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a depth-first fashion.
- depthFirst(IndefiniteGraph<N, E>, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a depth-first fashion.
- depthFirst(IndefiniteGraph<N, E>, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a depth-first fashion.
- depthFirst(TransitionSystem<S, ? super I, T>, int, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Traverses the given transition system in a depth-first fashion.
- depthFirst(TransitionSystem<S, I, T>, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Traverses the given transition system in a depth-first fashion.
- depthFirstIterator(IndefiniteGraph<N, E>, Collection<? extends N>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Returns an
Iterator
for the (reachable) nodes of the given graph in depth-first order. - depthFirstIterator(TransitionSystem<S, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Returns an
Iterator
for the (reachable) states of the given transition system in depth-first order. - depthFirstOrder(IndefiniteGraph<N, E>, Collection<? extends N>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Returns an
Iterable
for the (reachable) nodes of the given graph in depth-first order. - depthFirstOrder(TransitionSystem<S, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Returns an
Iterable
for the (reachable) states of the given transition system in depth-first order. - DeterministicEquivalenceTest - Class in net.automatalib.util.automaton.equivalence
- determinize(A) - Static method in class net.automatalib.util.automaton.fsa.NFAs
- determinize(A, boolean, boolean) - Static method in class net.automatalib.util.automaton.fsa.NFAs
- determinize(NFA<?, I>, Collection<? extends I>, MutableDFA<?, I>) - Static method in class net.automatalib.util.automaton.fsa.NFAs
- determinize(NFA<?, I>, Collection<? extends I>, MutableDFA<?, I>, boolean, boolean) - Static method in class net.automatalib.util.automaton.fsa.NFAs
- determinize(NFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.NFAs
- determinize(NFA<?, I>, Alphabet<I>, boolean, boolean) - Static method in class net.automatalib.util.automaton.fsa.NFAs
- DFABuilder<S,I,A extends MutableDFA<S,? super I>> - Class in net.automatalib.util.automaton.builder
- DFABuilder(A) - Constructor for class net.automatalib.util.automaton.builder.DFABuilder
- DFABuilder__0() - Constructor for class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__0
- DFABuilder__1() - Constructor for class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__1
- DFABuilder__2() - Constructor for class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__2
- DFABuilder__3() - Constructor for class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__3
- DFABuilder__4() - Constructor for class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__4
- DFABuilder__5() - Constructor for class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__5
- DFABuilder__6() - Constructor for class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__6
- DFABuilder.DFABuilder__0 - Class in net.automatalib.util.automaton.builder
- DFABuilder.DFABuilder__1 - Class in net.automatalib.util.automaton.builder
- DFABuilder.DFABuilder__2 - Class in net.automatalib.util.automaton.builder
- DFABuilder.DFABuilder__3 - Class in net.automatalib.util.automaton.builder
- DFABuilder.DFABuilder__4 - Class in net.automatalib.util.automaton.builder
- DFABuilder.DFABuilder__5 - Class in net.automatalib.util.automaton.builder
- DFABuilder.DFABuilder__6 - Class in net.automatalib.util.automaton.builder
- DFAs - Class in net.automatalib.util.automaton.fsa
-
Operations on
DFA
s. - DFRecord<S,I,T,D> - Class in net.automatalib.util.ts.traversal
- DFRecord(S, Collection<? extends I>, D) - Constructor for class net.automatalib.util.ts.traversal.DFRecord
- DFRecord.LastTransition<S,I,T,D> - Class in net.automatalib.util.ts.traversal
- DFS - Static variable in interface net.automatalib.util.automaton.copy.AutomatonCopyMethod
- DijkstraSSSP<N,E> - Class in net.automatalib.util.graph.sssp
-
Implementation of Dijkstras algorithm for the single-source shortest path problem.
- DijkstraSSSP(Graph<N, E>, N, EdgeWeights<E>) - Constructor for class net.automatalib.util.graph.sssp.DijkstraSSSP
-
Constructor.
- doCopy() - Method in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- doCopy() - Method in interface net.automatalib.util.automaton.copy.LowLevelAutomatonCopier
- DONT_PRUNE - net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization.PruningMode
-
Do not prune at all.
- DTSComposition<S1,S2,I,T1,T2,TS1 extends DeterministicTransitionSystem<S1,I,T1>,TS2 extends DeterministicTransitionSystem<S2,I,T2>> - Class in net.automatalib.util.ts.comp
- DTSComposition(TS1, TS2) - Constructor for class net.automatalib.util.ts.comp.DTSComposition
- DTSComposition(TS1, TS2, boolean) - Constructor for class net.automatalib.util.ts.comp.DTSComposition
E
- encodeStackSym(Pair<L1, L2>, I) - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- equals(Object) - Method in class net.automatalib.util.partitionrefinement.StateSignature
- equiv(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the equivalence ("<=>") of two DFA, and stores the result in a given mutable DFA.
- equiv(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the equivalence ("<=>") of two DFA, and returns the result as a new DFA.
- equiv(NFA<?, I>, NFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the equivalence ("<=>") of two NFAs, and stores the result in a given mutable NFA.
- equiv(NFA<?, I>, NFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the equivalence ("<=>") of two NFAs, and returns the result as a new NFA.
- equiv(OneSEVPA<L1, I>, OneSEVPA<L2, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Returns a view on the equivalence ("<=>") of two
OneSEVPA
s. - EQUIV - Static variable in interface net.automatalib.util.ts.acceptor.AcceptanceCombiner
- EXPLORE - net.automatalib.util.graph.traversal.GraphTraversalAction
-
Explore the respective node or edge.
- EXPLORE - net.automatalib.util.ts.traversal.TSTraversalAction
-
Explore the respective state or transition.
F
- FIFO - net.automatalib.util.partitionrefinement.PaigeTarjan.WorklistPolicy
-
Newly created blocks are inserted at the beginning of the worklist.
- filterByOutput(MealyMachine<?, I, ?, O>, Alphabet<I>, Predicate<? super O>) - Static method in class net.automatalib.util.automaton.transducer.MealyFilter
- filterByOutput(MealyMachine<S1, I, T1, O>, Collection<? extends I>, MutableMealyMachine<S2, I, ?, O>, Predicate<? super O>) - Static method in class net.automatalib.util.automaton.transducer.MealyFilter
- findAcceptedWord(OneSEVPA<L, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Returns a well-matched word (over the given alphabet) that is accepted by the given SEVPA, if existent.
- findAPSP() - Method in class net.automatalib.util.graph.apsp.FloydWarshallAPSP
- findAPSP(Graph<N, E>, EdgeWeights<E>) - Static method in class net.automatalib.util.graph.apsp.FloydWarshallAPSP
- findAPSP(Graph<N, E>, EdgeWeights<E>) - Static method in class net.automatalib.util.graph.Graphs
-
Computes the shortest paths between all pairs of nodes in a graph, using the Floyd-Warshall dynamic programming algorithm.
- findCharacterizingSet(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.equivalence.CharacterizingSets
-
Computes a characterizing set for the given automaton.
- findCharacterizingSet(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Collection<? extends I>, S, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.equivalence.CharacterizingSets
-
Computes a characterizing set for a specified state in the given automaton.
- findCharacterizingSet(OneSEVPA<L, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Computes a characterizing set for the given SEVPA.
- findIncrementalCharacterizingSet(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Collection<? extends I>, Collection<? extends Word<I>>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.equivalence.CharacterizingSets
- findReachableLocations(OneSEVPA<L, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Returns a list of locations that are reachable from the initial location of the given SEVPA via symbols of the given alphabet.
- findRejectedWord(OneSEVPA<L, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Returns a well-matched word (over the given alphabet) that is rejected by the given SEVPA, if existent.
- findSCCs(Graph<N, E>, SCCListener<N>) - Static method in class net.automatalib.util.graph.Graphs
-
Find all strongly-connected components in a graph.
- findSCCs(Graph<N, E>, SCCListener<N>) - Static method in class net.automatalib.util.graph.scc.SCCs
-
Find all strongly-connected components in a graph.
- findSeparatingWord(SBA<?, I>, SBA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Computes a separating word for the two given
SBA
s, if existent. - findSeparatingWord(SPA<?, I>, SPA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
-
Computes a separating word for the two given
SPA
s, if existent. - findSeparatingWord(SPMM<?, I, ?, O>, SPMM<?, I, ?, O>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPMMs
-
Computes a separating word for the two given
SPMM
s, if existent. - findSeparatingWord(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
-
Finds a separating word for two automata.
- findSeparatingWord(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.equivalence.NearLinearEquivalenceTest
- findSeparatingWord(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.equivalence.NearLinearEquivalenceTest
- findSeparatingWord(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, S, S, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
-
Finds a separating word for two states in an automaton.
- findSeparatingWord(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, S, S, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.equivalence.NearLinearEquivalenceTest
- findSeparatingWord(UniversalDeterministicAutomaton<S, I, T, ?, ?>, S, S, Collection<? extends I>, boolean) - Static method in class net.automatalib.util.automaton.equivalence.NearLinearEquivalenceTest
-
Find a separating word for two states in a given automaton.
- findSeparatingWord(UniversalDeterministicAutomaton<S, I, T, SP, TP>, UniversalDeterministicAutomaton<S2, I, T2, SP2, TP2>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.equivalence.DeterministicEquivalenceTest
- findSeparatingWord(UniversalDeterministicAutomaton<S, I, T, SP, TP>, UniversalDeterministicAutomaton<S2, I, T2, SP2, TP2>, Collection<? extends I>, boolean) - Static method in class net.automatalib.util.automaton.equivalence.NearLinearEquivalenceTest
- findSeparatingWord(UniversalDeterministicAutomaton<S, I, T, SP, TP>, UniversalDeterministicAutomaton<S2, I, T2, SP2, TP2>, Alphabet<I>, boolean) - Static method in class net.automatalib.util.automaton.equivalence.NearLinearEquivalenceTest
- findSeparatingWord(OneSEVPA<?, I>, OneSEVPA<?, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Finds a separating word for two SEVPAs, if existent.
- findSeparatingWord(OneSEVPA<L, I>, L, L, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Finds a separating word for two locations of a SEVPAs, if existent.
- findSeparatingWordLarge(UniversalDeterministicAutomaton<S, I, T, SP, TP>, UniversalDeterministicAutomaton<S2, I, T2, SP2, TP2>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.equivalence.DeterministicEquivalenceTest
- findShortestSeparatingWord(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
-
Finds a shortest separating word for two automata.
- findSSSP() - Method in class net.automatalib.util.graph.sssp.DijkstraSSSP
-
Start the search.
- findSSSP(Graph<N, E>, N, EdgeWeights<E>) - Static method in class net.automatalib.util.graph.Graphs
-
Computes the shortest paths between a single source node and all other nodes in a graph, using Dijkstra's algorithm.
- findSSSP(Graph<N, E>, N, EdgeWeights<E>) - Static method in class net.automatalib.util.graph.sssp.DijkstraSSSP
-
Search for the shortest paths from a single source node in a graph.
- finishExploration(N, D) - Method in interface net.automatalib.util.graph.traversal.GraphTraversalVisitor
-
Called when the exploration of a node is finished.
- finishExploration(N, TarjanSCCRecord) - Method in class net.automatalib.util.graph.scc.TarjanSCCVisitor
- finishExploration(S, D) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor
-
Called when the exploration of a state is finished.
- FloydWarshallAPSP<N,E> - Class in net.automatalib.util.graph.apsp
-
Implementation of the Floyd-Warshall dynamic programming algorithm for the all pairs shortest paths problem.
- FloydWarshallAPSP(Graph<N, E>, EdgeWeights<E>) - Constructor for class net.automatalib.util.graph.apsp.FloydWarshallAPSP
- forAutomaton(A) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- forDFA() - Static method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Creates a random IC automaton generator instance for generating DFAs.
- forDFA(double) - Static method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Creates a random IC automaton generator instance for generating DFAs.
- forDFA(A) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- forMealy(A) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- forMoore(A) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- forSST(A) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- foundSCC(Collection<? extends N>) - Method in class net.automatalib.util.graph.scc.SCCCollector
- foundSCC(Collection<? extends N>) - Method in interface net.automatalib.util.graph.scc.SCCListener
- from(Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- from(Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder
- from(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__1
- from(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__4
- from(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__6
- from(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder
- from(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder
- from(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- from(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- from(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder
- from(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__1
- from(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__4
- from(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__7
- from(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilder
- from(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__1
- from(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__4
- from(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__6
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__1
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__4
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__6
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.DFABuilder
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.MealyBuilder
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__1
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__4
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__7
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.MooreBuilder
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__1
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__4
- from(Object, Object...) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__6
- FSABuilder<S,I,A extends MutableFSA<S,? super I>> - Class in net.automatalib.util.automaton.builder
- FSABuilder(A) - Constructor for class net.automatalib.util.automaton.builder.FSABuilder
- FSABuilder__0() - Constructor for class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__0
- FSABuilder__1() - Constructor for class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__1
- FSABuilder__2() - Constructor for class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- FSABuilder__3() - Constructor for class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- FSABuilder.FSABuilder__0 - Class in net.automatalib.util.automaton.builder
- FSABuilder.FSABuilder__1 - Class in net.automatalib.util.automaton.builder
- FSABuilder.FSABuilder__2 - Class in net.automatalib.util.automaton.builder
- FSABuilder.FSABuilder__3 - Class in net.automatalib.util.automaton.builder
G
- generateICDeterministicAutomaton(int, Collection<? extends I>, A, Random) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Generates an initially connected (IC) deterministic automaton with the given parameters.
- generateICDeterministicAutomaton(int, Alphabet<I>, AutomatonCreator<? extends A, I>, Random) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Generates an initially-connected (IC) deterministic automaton with the given parameters.
- get() - Method in class net.automatalib.util.automaton.ads.LYResult
- get(int) - Method in class net.automatalib.util.graph.Path
- get(Block<?, ?>) - Method in class net.automatalib.util.minimizer.BlockMap
-
Retrieves a value.
- getAutomaton() - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- getBlockForState(int) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Retrieves the corresponding block for a given state (ID).
- getBlockForState(S) - Method in class net.automatalib.util.minimizer.MinimizationResult
-
Retrieves the block to which a given original state belongs.
- getBlocks() - Method in class net.automatalib.util.minimizer.MinimizationResult
-
Retrieves all blocks in the final partition.
- getEdgeWeight(E) - Method in class net.automatalib.util.graph.concept.PropertyEdgeWeights
- getElement() - Method in class net.automatalib.util.minimizer.Block
- getId() - Method in class net.automatalib.util.minimizer.Block
-
Retrieves the ID of this block.
- getIndistinguishableStates() - Method in class net.automatalib.util.automaton.ads.LYResult
- getInitialLocation() - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- getInitialNode() - Method in class net.automatalib.util.graph.sssp.DijkstraSSSP
- getInitialNode() - Method in interface net.automatalib.util.graph.sssp.SSSPResult
-
Retrieves the node the source was started from.
- getInitialState() - Method in class net.automatalib.util.ts.comp.DTSComposition
- getInitialStates() - Method in class net.automatalib.util.ts.comp.TSComposition
- getInternalSuccessor(Pair<L1, L2>, I) - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- getLabel() - Method in class net.automatalib.util.minimizer.BlockEdge
-
Retrieves the transition label.
- getLastTransition() - Method in class net.automatalib.util.ts.traversal.DFRecord
- getLocation(int) - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- getLocationId(Pair<L1, L2>) - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- getLocations() - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- getMaxDepth() - Method in class net.automatalib.util.automaton.conformance.IncrementalWMethodTestsIterator
- getNodes() - Method in class net.automatalib.util.graph.Path
- getNumBlocks() - Method in class net.automatalib.util.minimizer.MinimizationResult
-
Retrieves the number of blocks in the final partition.
- getNumBlocks() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Retrieves the total number of blocks in the block list.
- getNumStackSymbols() - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- getOutgoingEdgeArray(Block<S, L>) - Method in class net.automatalib.util.minimizer.BlockAutomaton
-
Retrieves an array of outgoing edges of a block (state).
- getOutgoingEdges(Block<S, L>) - Method in class net.automatalib.util.minimizer.BlockAutomaton
-
Retrieves a list of outgoing edges of a block (state).
- getOutputForSuccessor(ADSNode<S, I, O>, ADSNode<S, I, O>) - Static method in class net.automatalib.util.automaton.ads.ADSUtil
- getRepresentative(Block<S, L>) - Method in class net.automatalib.util.minimizer.MinimizationResult
-
Chooses a representative (i.e., an arbitrary element of the set of states) from a block.
- getRepresentative(Block) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Retrieves a representative state from the given block.
- getReturnSuccessor(Pair<L1, L2>, I, int) - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- getSCCList() - Method in class net.automatalib.util.graph.scc.SCCCollector
- getShortestPath(N) - Method in class net.automatalib.util.graph.sssp.DijkstraSSSP
- getShortestPath(N) - Method in interface net.automatalib.util.graph.sssp.SSSPResult
-
Retrieves the shortest path from the initial node to the given one (as a sequence of edges), or
null
if there exists no such path. - getShortestPath(N, N) - Method in interface net.automatalib.util.graph.apsp.APSPResult
-
Retrieves the shortest path between the given nodes, or
null
if there exists no such path. - getShortestPath(N, N) - Method in class net.automatalib.util.graph.apsp.FloydWarshallAPSP
- getShortestPathDistance(N) - Method in class net.automatalib.util.graph.sssp.DijkstraSSSP
- getShortestPathDistance(N) - Method in interface net.automatalib.util.graph.sssp.SSSPResult
-
Retrieves the length of the shortest path from the initial node to the given one.
- getShortestPathDistance(N, N) - Method in interface net.automatalib.util.graph.apsp.APSPResult
-
Retrieves the length of the shortest path between the given nodes.
- getShortestPathDistance(N, N) - Method in class net.automatalib.util.graph.apsp.FloydWarshallAPSP
- getShortestPathEdge(N) - Method in class net.automatalib.util.graph.sssp.DijkstraSSSP
- getShortestPathEdge(N) - Method in interface net.automatalib.util.graph.sssp.SSSPResult
-
Retrieves the incoming edge via which the given node is reached on the shortest path.
- getSource() - Method in class net.automatalib.util.minimizer.BlockEdge
-
Retrieves the source block.
- getStateMapping() - Method in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- getStateMapping() - Method in interface net.automatalib.util.automaton.copy.LowLevelAutomatonCopier
- getStateMapping() - Method in class net.automatalib.util.ts.copy.TSCopyVisitor
- getStatesInBlock(Block<S, L>) - Static method in class net.automatalib.util.minimizer.MinimizationResult
-
Retrieves all (original) states in a block.
- getSuccessor(Pair<T1, T2>) - Method in class net.automatalib.util.ts.comp.DTSComposition
- getSuccessor(Pair<T1, T2>) - Method in class net.automatalib.util.ts.comp.TSComposition
- getTarget() - Method in class net.automatalib.util.minimizer.BlockEdge
-
Retrieves the target block.
- getTransition(Pair<S1, S2>, I) - Method in class net.automatalib.util.ts.comp.DTSComposition
- getTransitions(Pair<S1, S2>, I) - Method in class net.automatalib.util.ts.comp.TSComposition
- GraphCopy - Class in net.automatalib.util.graph.copy
- Graphs - Class in net.automatalib.util.graph
- GraphTraversal - Class in net.automatalib.util.graph.traversal
- GraphTraversalAction - Enum in net.automatalib.util.graph.traversal
-
The type of
GraphTraversalAction
to be performed. - GraphTraversalVisitor<N,E,D> - Interface in net.automatalib.util.graph.traversal
-
Visitor interface for graph traversals.
H
- hashCode() - Method in class net.automatalib.util.partitionrefinement.StateSignature
- hasNext() - Method in class net.automatalib.util.automaton.conformance.IncrementalWMethodTestsIterator
- hasUndefinedInput(Automaton<?, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
- hasVisited(N) - Method in class net.automatalib.util.graph.scc.TarjanSCCVisitor
- high - Variable in class net.automatalib.util.partitionrefinement.Block
-
The index of the last element in this block in the
PaigeTarjan.blockData
array, plus one. - HopcroftMinimization - Class in net.automatalib.util.automaton.minimizer.hopcroft
-
Versions of Hopcroft's minimization algorithm for deterministic finite automata.
- HopcroftMinimization.PruningMode - Enum in net.automatalib.util.automaton.minimizer.hopcroft
-
Allows for controlling how automata are pruned during minimization.
I
- id - Variable in class net.automatalib.util.partitionrefinement.Block
- IGNORE - net.automatalib.util.graph.traversal.GraphTraversalAction
-
Ignore the current node or edge but continue with the remaining exploration.
- IGNORE - net.automatalib.util.ts.traversal.TSTraversalAction
-
Ignore the current state or transition but continue with the remaining exploration.
- IllegalConjunctionException - Exception in net.automatalib.util.ts.modal
- IllegalConjunctionException(String) - Constructor for exception net.automatalib.util.ts.modal.IllegalConjunctionException
- impl(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the implication ("=>") of two DFA, and stores the result in a given mutable DFA.
- impl(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the implication ("=>") of two DFA, and returns the result as a new DFA.
- impl(NFA<?, I>, NFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the implication ("=>") of two NFAs, and stores the result in a given mutable NFA.
- impl(NFA<?, I>, NFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the implication ("=>") of two NFAs, and returns the result as a new NFA.
- impl(OneSEVPA<L1, I>, OneSEVPA<L2, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Returns a view on the implication ("=>") of two
OneSEVPA
s. - IMPL - Static variable in interface net.automatalib.util.ts.acceptor.AcceptanceCombiner
- in - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- incomingEdges(Graph<N, E>) - Static method in class net.automatalib.util.graph.Graphs
- incrementalCharacterizingSet(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>, Collection<? extends Word<I>>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.Automata
- incrementalCharacterizingSetIterator(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>, Collection<? extends Word<I>>) - Static method in class net.automatalib.util.automaton.equivalence.CharacterizingSets
- incrementalCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? extends Word<I>>, Collection<? extends Word<I>>, Collection<? super Word<I>>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Utility method that allows to compute an incremental state and transition cover simultaneously.
- incrementalStateCover(DeterministicAutomaton<S, I, ?>, Collection<? extends I>, Collection<? extends Word<I>>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Computes an incremental state cover for a given automaton, i.e. a cover that only contains the missing sequences for obtaining a complete state cover.
- incrementalStateCoverIterator(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? extends Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Returns an iterator for the remaining sequences of a state cover.
- incrementalStructuralCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? extends Word<I>>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Computes an incremental structural cover for a given automaton, i.e. a cover that only contains the missing sequences for obtaining a complete structural cover.
- incrementalTransitionCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? extends Word<I>>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Computes an incremental transition cover for a given automaton, i.e. a cover that only contains the missing sequences for obtaining a complete transition cover.
- incrementalTransitionCoverIterator(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? extends Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Returns an iterator for the remaining sequences of a transition cover.
- IncrementalWMethodTestsIterator<I> - Class in net.automatalib.util.automaton.conformance
-
An iterator that enumerates the test cases as obtained through the W method conformance test in an incremental fashion.
- IncrementalWMethodTestsIterator(Alphabet<I>) - Constructor for class net.automatalib.util.automaton.conformance.IncrementalWMethodTestsIterator
- initBlockForStateMap() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Automatically creates a
PaigeTarjan.blockForState
mapping, and sets it as the current one. - initCompleteDeterministic(PaigeTarjan, SimpleDeterministicAutomaton.FullIntAbstraction, IntFunction<?>, boolean) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers
-
Initializes the partition refinement data structure from a given abstracted deterministic automaton, partitioning states according to the given classification function.
- initCompleteDeterministic(PaigeTarjan, UniversalDeterministicAutomaton.FullIntAbstraction<?, ?, ?>, AutomatonInitialPartitioning, boolean) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers
-
Initializes the partition refinement data structure from a given abstracted deterministic automaton, using a predefined initial partitioning mode.
- initDeterministic(PaigeTarjan, SimpleDeterministicAutomaton.FullIntAbstraction, IntFunction<?>, Object) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers
-
Initializes the partition refinement data structure from a given deterministic automaton, initializing the initial partition according to the given classification function.
- initialClassifier(UniversalDeterministicAutomaton.FullIntAbstraction<?, ?, ?>) - Method in enum net.automatalib.util.partitionrefinement.AutomatonInitialPartitioning
- initWorklist(boolean) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Initializes the worklist from the block list.
- input - Variable in class net.automatalib.util.ts.traversal.DFRecord.LastTransition
- input - Variable in class net.automatalib.util.ts.TS.TransRef
- inputIn(Object...) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- inputIn(Collection<?>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- inputIs(Object) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- inputIsNot(Object) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- inputNotIn(Object...) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- inputNotIn(Collection<?>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- inputs - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- inputs - Variable in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- inputSatisfying(Predicate<? super I>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- inputsMapping - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- INVALID_DISTANCE - Static variable in class net.automatalib.util.graph.Graphs
-
Float value to signal that no valid distance is returned (e.g., when attempting to retrieve the length of a path that does not exist).
- invasiveMinimize(A, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
- isAcceptingLocation(Pair<L1, L2>) - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- isEmpty() - Method in class net.automatalib.util.minimizer.Block
-
Checks whether this block is empty, i.e., contains no states.
- isEmpty() - Method in class net.automatalib.util.partitionrefinement.Block
-
Checks whether this block is empty.
- isMinimal(ProceduralInputAlphabet<I>, ATRSequences<I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
-
Checks if a pre-computed set of
ATRSequences
of anSPA
is minimal. - isMinimal(SPA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
-
Convenience method for
SPAs.isMinimal(SPA, ProceduralInputAlphabet)
that usesProceduralSystem.getInputAlphabet()
asalphabet
. - isMinimal(SPA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
-
Checks if a given
SPA
is redundancy-free, i.e. if for allprocedures
there exists an access sequence, terminating sequence, and return sequence. - isOnwardSST(SubsequentialTransducer<S, I, T, O>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.transducer.SubsequentialTransducers
-
Checks whether a given
SubsequentialTransducer
is onward, i.e. if for each state (sans initial state) the longest common prefix over its state property and the transition properties of its outgoing edges equalsepsilon
. - isPrefixClosed(DFA<S, I>, Collection<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Computes whether the language of the given DFA is prefix-closed.
- isPresent() - Method in class net.automatalib.util.automaton.ads.LYResult
- isRefinementOf(ModalTransitionSystem<AS, I, ?, ?>, ModalTransitionSystem<BS, I, ?, ?>, Collection<I>) - Static method in class net.automatalib.util.ts.modal.MTSs
- isSingleton() - Method in class net.automatalib.util.minimizer.Block
-
Checks whether this block is a singleton, i.e., contains only a single state.
- isValid(SBA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Checks whether the given
SBA
is valid, This is a convenience method forSBAs.isValid(SBA, ProceduralInputAlphabet)
that uses theinput alphabet
of the givenSBA
. - isValid(SBA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Checks whether the given
SBA
is valid with respect to the givenProceduralInputAlphabet
, i.e., whether itsprocedures
are prefix-closed, return-closed, and call-closed. - isValid(SPMM<?, I, ?, O>) - Static method in class net.automatalib.util.automaton.procedural.SPMMs
-
Checks whether the given
SPMM
is valid, This is a convenience method forSPMMs.isValid(SPMM, ProceduralInputAlphabet)
that uses theinput alphabet
of the givenSPMM
. - isValid(SPMM<?, I, ?, O>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPMMs
-
Checks whether the given
SPMM
is valid with respect to the givenProceduralInputAlphabet
, i.e., whether itsprocedures
are error-closed, return-closed, and call-closed.
L
- l2Iterator(I) - Method in class net.automatalib.util.automaton.conformance.SPATestsIterator
- l2Iterator(Word<I>) - Method in class net.automatalib.util.automaton.conformance.WMethodTestsIterator
- l2Iterator(S) - Method in class net.automatalib.util.ts.iterator.AllDefinedInputsIterator
- l2Iterator(S) - Method in class net.automatalib.util.ts.iterator.AllUndefinedInputsIterator
- l3Iterator(Word<I>, List<I>) - Method in class net.automatalib.util.automaton.conformance.WMethodTestsIterator
- LeeYannakakis - Class in net.automatalib.util.automaton.ads
-
Algorithm of Lee and Yannakakis for computing adaptive distinguishing sequences (of length at most n^2) in O(n^2) time (where n denotes the number of states of the automaton).
- LIFO - net.automatalib.util.partitionrefinement.PaigeTarjan.WorklistPolicy
-
Newly created blocks are inserted at the end of the worklist.
- loop() - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__1
- loop() - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- loop() - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__3
- loop() - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__2
- loop() - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__5
- loop() - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__1
- loop() - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- loop() - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__2
- loop() - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__5
- loop() - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__6
- loop() - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__8
- loop() - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__2
- loop() - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__5
- low - Variable in class net.automatalib.util.partitionrefinement.Block
-
The index of the first element in this block in the
PaigeTarjan.blockData
array. - LowLevelAutomatonCopier<S1,S2> - Interface in net.automatalib.util.automaton.copy
- LYResult<S,I,O> - Class in net.automatalib.util.automaton.ads
-
Utility class that holds some information aggregated during the ADS computation of
LeeYannakakis
.
M
- mapCallSymbol(AI) - Method in class net.automatalib.util.automaton.vpa.StringSymbolMapper
- mapCallSymbol(AI) - Method in interface net.automatalib.util.automaton.vpa.SymbolMapper
-
Returns for an abstract call symbol of a
VPAlphabet
its mapped call symbol of aProceduralInputAlphabet
. - mapInternalSymbol(AI) - Method in class net.automatalib.util.automaton.vpa.StringSymbolMapper
- mapInternalSymbol(AI) - Method in interface net.automatalib.util.automaton.vpa.SymbolMapper
-
Returns for an abstract internal symbol of a
VPAlphabet
its mapped internal symbol of aProceduralInputAlphabet
. - mapReturnSymbol(AI) - Method in class net.automatalib.util.automaton.vpa.StringSymbolMapper
- mapReturnSymbol(AI) - Method in interface net.automatalib.util.automaton.vpa.SymbolMapper
-
Returns for an abstract return symbol of a
VPAlphabet
its mapped return symbol of aProceduralInputAlphabet
. - MealyBuilder<S,I,T,O,A extends MutableMealyMachine<S,? super I,T,? super O>> - Class in net.automatalib.util.automaton.builder
- MealyBuilder(A) - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder
- MealyBuilder__0() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__0
- MealyBuilder__1() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__1
- MealyBuilder__2() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__2
- MealyBuilder__3() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__3
- MealyBuilder__4() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__4
- MealyBuilder__5() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__5
- MealyBuilder__6() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__6
- MealyBuilder__7() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__7
- MealyBuilder__8() - Constructor for class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__8
- MealyBuilder.MealyBuilder__0 - Class in net.automatalib.util.automaton.builder
- MealyBuilder.MealyBuilder__1 - Class in net.automatalib.util.automaton.builder
- MealyBuilder.MealyBuilder__2 - Class in net.automatalib.util.automaton.builder
- MealyBuilder.MealyBuilder__3 - Class in net.automatalib.util.automaton.builder
- MealyBuilder.MealyBuilder__4 - Class in net.automatalib.util.automaton.builder
- MealyBuilder.MealyBuilder__5 - Class in net.automatalib.util.automaton.builder
- MealyBuilder.MealyBuilder__6 - Class in net.automatalib.util.automaton.builder
- MealyBuilder.MealyBuilder__7 - Class in net.automatalib.util.automaton.builder
- MealyBuilder.MealyBuilder__8 - Class in net.automatalib.util.automaton.builder
- MealyFilter - Class in net.automatalib.util.automaton.transducer
-
Various utility methods to filter Mealy machines.
- MealyMachines - Class in net.automatalib.util.automaton.transducer
- MIN_LENGTH - net.automatalib.util.automaton.ads.BacktrackingSearch.CostAggregator
- MIN_SIZE - net.automatalib.util.automaton.ads.BacktrackingSearch.CostAggregator
- MinimizationResult<S,L> - Class in net.automatalib.util.minimizer
-
The result structure of a minimization process.
- minimize(A) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Minimizes the given DFA.
- minimize(DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Minimizes the given DFA over the given alphabet.
- minimize(UniversalDeterministicAutomaton<S, I, T, SP, TP>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.Automata
- minimize(OneSEVPA<?, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Minimizes the given
OneSEVPA
over the given alphabet. - minimize(OneSEVPA<?, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.minimizer.OneSEVPAMinimizer
- minimize(UniversalGraph<S, ?, ?, L>) - Static method in class net.automatalib.util.minimizer.Minimizer
-
Minimizes an automaton.
- minimize(UniversalGraph<S, ?, ?, L>, Collection<? extends S>) - Static method in class net.automatalib.util.minimizer.Minimizer
- minimizeDFA(A) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given DFA.
- minimizeDFA(A) - Static method in class net.automatalib.util.automaton.minimizer.paigetarjan.PaigeTarjanMinimization
-
Minimizes the given DFA.
- minimizeDFA(A, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given DFA.
- minimizeDFA(DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given DFA.
- minimizeDFA(DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.minimizer.paigetarjan.PaigeTarjanMinimization
-
Minimizes the given DFA.
- minimizeDFA(DFA<?, I>, Alphabet<I>, AutomatonCreator<A, I>) - Static method in class net.automatalib.util.automaton.minimizer.paigetarjan.PaigeTarjanMinimization
-
Minimizes the given DFA.
- minimizeDFA(DFA<?, I>, Alphabet<I>, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given DFA.
- minimizeDFA(DFA<?, I>, Alphabet<I>, HopcroftMinimization.PruningMode, AutomatonCreator<A, I>) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given DFA.
- minimizeMealy(A) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given Mealy machine.
- minimizeMealy(A) - Static method in class net.automatalib.util.automaton.minimizer.paigetarjan.PaigeTarjanMinimization
-
Minimizes the given Mealy machine.
- minimizeMealy(A, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given Mealy machine.
- minimizeMealy(MealyMachine<?, I, ?, O>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given Mealy machine.
- minimizeMealy(MealyMachine<?, I, ?, O>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.minimizer.paigetarjan.PaigeTarjanMinimization
-
Minimizes the given Mealy machine.
- minimizeMealy(MealyMachine<?, I, ?, O>, Alphabet<I>, AutomatonCreator<A, I>) - Static method in class net.automatalib.util.automaton.minimizer.paigetarjan.PaigeTarjanMinimization
-
Minimizes the given Mealy machine.
- minimizeMealy(MealyMachine<?, I, ?, O>, Alphabet<I>, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given Mealy machine.
- minimizeMealy(MealyMachine<?, I, ?, O>, Alphabet<I>, HopcroftMinimization.PruningMode, AutomatonCreator<A, I>) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given Mealy machine.
- Minimizer<S,L> - Class in net.automatalib.util.minimizer
-
Automaton minimizer.
- Minimizer() - Constructor for class net.automatalib.util.minimizer.Minimizer
- minimizeUniversal(UniversalDeterministicAutomaton<?, I, T, SP, TP>, Alphabet<I>, AutomatonCreator<A, I>, AutomatonInitialPartitioning, Object) - Static method in class net.automatalib.util.automaton.minimizer.paigetarjan.PaigeTarjanMinimization
-
Minimizes the given automaton depending on the given partitioning function.
- minimizeUniversal(UniversalDeterministicAutomaton<?, I, T, SP, TP>, Alphabet<I>, AutomatonCreator<A, I>, AutomatonInitialPartitioning, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization
-
Minimizes the given automaton depending on the given partitioning function.
- ModalRefinement - Class in net.automatalib.util.ts.modal
- MooreBuilder<S,I,T,O,A extends MutableMooreMachine<S,? super I,T,? super O>> - Class in net.automatalib.util.automaton.builder
- MooreBuilder(A) - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder
- MooreBuilder(MooreBuilderImpl<S, I, T, O, A>) - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder
- MooreBuilder__0() - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__0
- MooreBuilder__1() - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__1
- MooreBuilder__2() - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__2
- MooreBuilder__3() - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__3
- MooreBuilder__4() - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__4
- MooreBuilder__5() - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__5
- MooreBuilder__6() - Constructor for class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__6
- MooreBuilder.MooreBuilder__0 - Class in net.automatalib.util.automaton.builder
- MooreBuilder.MooreBuilder__1 - Class in net.automatalib.util.automaton.builder
- MooreBuilder.MooreBuilder__2 - Class in net.automatalib.util.automaton.builder
- MooreBuilder.MooreBuilder__3 - Class in net.automatalib.util.automaton.builder
- MooreBuilder.MooreBuilder__4 - Class in net.automatalib.util.automaton.builder
- MooreBuilder.MooreBuilder__5 - Class in net.automatalib.util.automaton.builder
- MooreBuilder.MooreBuilder__6 - Class in net.automatalib.util.automaton.builder
- MooreBuilderImpl<S,I,T,O,A extends MutableMooreMachine<S,? super I,T,? super O>> - Class in net.automatalib.util.automaton.builder
- MTSs - Class in net.automatalib.util.ts.modal
-
Operations on
ModalTransitionSystem
s. - MutableDFAs - Class in net.automatalib.util.automaton.fsa
- MutableMealyMachines - Class in net.automatalib.util.automaton.transducer
N
- NearLinearEquivalenceTest - Class in net.automatalib.util.automaton.equivalence
- net.automatalib.util - package net.automatalib.util
-
This package (including sub-packages) contains several utility methods for the different types of automata, transition systems, and graphs supported by AutomataLib.
- net.automatalib.util.automaton - package net.automatalib.util.automaton
- net.automatalib.util.automaton.ads - package net.automatalib.util.automaton.ads
- net.automatalib.util.automaton.builder - package net.automatalib.util.automaton.builder
- net.automatalib.util.automaton.conformance - package net.automatalib.util.automaton.conformance
- net.automatalib.util.automaton.copy - package net.automatalib.util.automaton.copy
- net.automatalib.util.automaton.cover - package net.automatalib.util.automaton.cover
- net.automatalib.util.automaton.equivalence - package net.automatalib.util.automaton.equivalence
- net.automatalib.util.automaton.fsa - package net.automatalib.util.automaton.fsa
- net.automatalib.util.automaton.minimizer.hopcroft - package net.automatalib.util.automaton.minimizer.hopcroft
- net.automatalib.util.automaton.minimizer.paigetarjan - package net.automatalib.util.automaton.minimizer.paigetarjan
- net.automatalib.util.automaton.predicate - package net.automatalib.util.automaton.predicate
- net.automatalib.util.automaton.procedural - package net.automatalib.util.automaton.procedural
- net.automatalib.util.automaton.random - package net.automatalib.util.automaton.random
- net.automatalib.util.automaton.transducer - package net.automatalib.util.automaton.transducer
- net.automatalib.util.automaton.vpa - package net.automatalib.util.automaton.vpa
- net.automatalib.util.graph - package net.automatalib.util.graph
- net.automatalib.util.graph.apsp - package net.automatalib.util.graph.apsp
- net.automatalib.util.graph.concept - package net.automatalib.util.graph.concept
- net.automatalib.util.graph.copy - package net.automatalib.util.graph.copy
- net.automatalib.util.graph.scc - package net.automatalib.util.graph.scc
- net.automatalib.util.graph.sssp - package net.automatalib.util.graph.sssp
- net.automatalib.util.graph.traversal - package net.automatalib.util.graph.traversal
- net.automatalib.util.minimizer - package net.automatalib.util.minimizer
- net.automatalib.util.partitionrefinement - package net.automatalib.util.partitionrefinement
- net.automatalib.util.traversal - package net.automatalib.util.traversal
- net.automatalib.util.ts - package net.automatalib.util.ts
- net.automatalib.util.ts.acceptor - package net.automatalib.util.ts.acceptor
- net.automatalib.util.ts.comp - package net.automatalib.util.ts.comp
- net.automatalib.util.ts.copy - package net.automatalib.util.ts.copy
- net.automatalib.util.ts.iterator - package net.automatalib.util.ts.iterator
- net.automatalib.util.ts.modal - package net.automatalib.util.ts.modal
- net.automatalib.util.ts.transducer - package net.automatalib.util.ts.transducer
- net.automatalib.util.ts.traversal - package net.automatalib.util.ts.traversal
- newDFA(Alphabet<I>) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- newMealy(Alphabet<I>) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- newMoore(Alphabet<I>) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- newNFA(Alphabet<I>) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- newSST(Alphabet<I>) - Static method in class net.automatalib.util.automaton.builder.AutomatonBuilders
- next() - Method in class net.automatalib.util.automaton.conformance.IncrementalWMethodTestsIterator
- nextBlock - Variable in class net.automatalib.util.partitionrefinement.Block
- nextInWorklist - Variable in class net.automatalib.util.partitionrefinement.Block
- nextTouched - Variable in class net.automatalib.util.partitionrefinement.Block
- NFAs - Class in net.automatalib.util.automaton.fsa
-
Operations on
NFA
s. - NO_LIMIT - Static variable in class net.automatalib.util.graph.traversal.GraphTraversal
- NO_LIMIT - Static variable in class net.automatalib.util.ts.traversal.TSTraversal
- NOT_VISITED - Static variable in enum net.automatalib.util.traversal.VisitedState
-
Nodes that have not yet been visited.
- number - Variable in class net.automatalib.util.graph.scc.TarjanSCCRecord
-
The index of this record in the order of discovery, i.e. the record belongs to the number-th node discovered during DFS traversal.
- numInputs - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The number of input symbols.
- numStates - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The number of states.
O
- on(I) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__0
- on(I) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- on(I) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__0
- on(I) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__3
- on(I) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__4
- on(I) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__6
- on(I) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__0
- on(I) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- on(I) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- on(I) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__0
- on(I) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__3
- on(I) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__4
- on(I) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__7
- on(I) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__0
- on(I) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__3
- on(I) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__4
- on(I) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__6
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__0
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__0
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__3
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__4
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__6
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__0
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__0
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__3
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__4
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__7
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__0
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__3
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__4
- on(I, I...) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__6
- OneSEVPAMinimizer - Class in net.automatalib.util.minimizer
-
A Paige/Tarjan partition refinement based minimizer for
OneSEVPA
s. - OneSEVPAs - Class in net.automatalib.util.automaton.vpa
-
Operations on
OneSEVPA
s. - or(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the disjunction ("or") of two DFA, and stores the result in a given mutable DFA.
- or(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the disjunction ("or") of two DFA, and returns the result as a new DFA.
- or(NFA<?, I>, NFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the disjunction ("or") of two NFAs, and stores the result in a given mutable NFA.
- or(NFA<?, I>, NFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the disjunction ("or") of two NFAs, and returns the result as a new NFA.
- or(OneSEVPA<L1, I>, OneSEVPA<L2, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Returns a view on the disjunction ("or") of two
OneSEVPA
s. - OR - Static variable in interface net.automatalib.util.ts.acceptor.AcceptanceCombiner
- out - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- outputIn(TransitionOutput<? super T, ?>, Object...) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- outputIn(TransitionOutput<? super T, ?>, Collection<?>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- outputIs(TransitionOutput<? super T, ?>, Object) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- outputIsNot(TransitionOutput<? super T, ?>, Object) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- outputNotIn(TransitionOutput<? super T, ?>, Object...) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- outputNotIn(TransitionOutput<? super T, ?>, Collection<?>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- outputSatisfies(TransitionOutput<? super T, ? extends O>, Predicate<? super O>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- outputViolates(TransitionOutput<? super T, ? extends O>, Predicate<? super O>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
P
- PaigeTarjan - Class in net.automatalib.util.partitionrefinement
-
An implementation of the Paige/Tarjan partition refinement algorithm.
- PaigeTarjan() - Constructor for class net.automatalib.util.partitionrefinement.PaigeTarjan
- PaigeTarjan.WorklistPolicy - Enum in net.automatalib.util.partitionrefinement
-
Determines how the worklist is managed, i.e., where newly created blocks are inserted.
- PaigeTarjanExtractors - Class in net.automatalib.util.partitionrefinement
-
This class provides methods for translating the result of a
PaigeTarjan
coarsest stable partition computation into several common, more usable forms such as automata. - PaigeTarjanInitializers - Class in net.automatalib.util.partitionrefinement
-
This class provides several methods to initialize a
PaigeTarjan
partition refinement data structure from common sources, e.g., automata. - PaigeTarjanMinimization - Class in net.automatalib.util.automaton.minimizer.paigetarjan
-
A utility class that offers shorthand methods for minimizing automata using the partition refinement approach of
PaigeTarjan
. - Path<N,E> - Class in net.automatalib.util.graph
- performMinimization(UniversalGraph<S, ?, ?, L>) - Method in class net.automatalib.util.minimizer.Minimizer
- performMinimization(UniversalGraph<S, E, ?, L>, Collection<? extends S>) - Method in class net.automatalib.util.minimizer.Minimizer
-
Performs the minimization of an automaton.
- posData - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The array storing the position data, i.e., for each state, its index in the
PaigeTarjan.blockData
array. - posDataLow - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The lowest index storing position data in the
PaigeTarjan.posData
array. - predData - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The array storing the predecessor data, i.e., for each state and input symbol, a list of the respective predecessors.
- predOfsData - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The array storing the predecessor offset data, i.e., for each state and input symbol, the delimiting offsets of the respective predecessor list.
- predOfsDataLow - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
The lowest index storing predecessor offset data in the
PaigeTarjan.predOfsData
array. - prefixSum(int[], int, int) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers
- processEdge(N, D, E, N, Holder<D>) - Method in interface net.automatalib.util.graph.traversal.GraphTraversalVisitor
-
Called when an edge is processed.
- processEdge(N, TarjanSCCRecord, E, N, Holder<TarjanSCCRecord>) - Method in class net.automatalib.util.graph.scc.TarjanSCCVisitor
- processInitial(N, Holder<D>) - Method in interface net.automatalib.util.graph.traversal.GraphTraversalVisitor
-
Called when the initial nodes (as passed to the traversal method) are processed.
- processInitial(N, Holder<TarjanSCCRecord>) - Method in class net.automatalib.util.graph.scc.TarjanSCCVisitor
- processInitial(S1, Holder<S2>) - Method in class net.automatalib.util.ts.copy.TSCopyVisitor
- processInitial(S, Holder<D>) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor
-
Called when the initial states of the transition system are processed.
- processTransition(S1, S2, I1, T1, S1, Holder<S2>) - Method in class net.automatalib.util.ts.copy.TSCopyVisitor
- processTransition(S, D, I, T, S, Holder<D>) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor
-
Called when an edge is processed.
- ProductOneSEVPA<L1,L2,I> - Class in net.automatalib.util.automaton.vpa
-
Production automaton that allows to join two given
OneSEVPA
s. - ProductOneSEVPA(VPAlphabet<I>, OneSEVPA<L1, I>, OneSEVPA<L2, I>, AcceptanceCombiner) - Constructor for class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- PropertyEdgeWeights<E> - Class in net.automatalib.util.graph.concept
- PropertyEdgeWeights(UniversalGraph<?, E, ?, ? extends Number>) - Constructor for class net.automatalib.util.graph.concept.PropertyEdgeWeights
- PRUNE_AFTER - net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization.PruningMode
-
Prune after the computation of equivalent states.
- PRUNE_BEFORE - net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization.PruningMode
-
Prune the automaton before the computation of equivalent states.
- pruneTransitionsWithOutput(MealyMachine<?, I, ?, O>, Alphabet<I>, Collection<? super O>) - Static method in class net.automatalib.util.automaton.transducer.MealyFilter
-
Returns a Mealy machine with all transitions removed that have one of the specified output values.
- pruneTransitionsWithOutput(MealyMachine<?, I, ?, O>, Alphabet<I>, O...) - Static method in class net.automatalib.util.automaton.transducer.MealyFilter
-
Returns a Mealy machine with all transitions removed that have one of the specified output values.
- ptr - Variable in class net.automatalib.util.partitionrefinement.Block
-
The current pointer, i.e., the delimiter between elements of this block which were found to belong to a potential subclass of this block, and those that do not or have not been checked.
- put(Block<?, ?>, V) - Method in class net.automatalib.util.minimizer.BlockMap
-
Stores a value.
R
- random - Variable in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- RandomAutomata - Class in net.automatalib.util.automaton.random
- RandomAutomatonGenerator<S,I,T,SP,TP,A extends MutableAutomaton<S,I,T,SP,TP>> - Class in net.automatalib.util.automaton.random
- RandomAutomatonGenerator(Random, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A) - Constructor for class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- randomDeterministic(Random, @org.checkerframework.checker.index.qual.NonNegative int, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomDeterministic(Random, @org.checkerframework.checker.index.qual.NonNegative int, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- RandomDeterministicAutomatonGenerator<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> - Class in net.automatalib.util.automaton.random
- RandomDeterministicAutomatonGenerator(Random, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A) - Constructor for class net.automatalib.util.automaton.random.RandomDeterministicAutomatonGenerator
- randomDFA(Random, @org.checkerframework.checker.index.qual.NonNegative int, Alphabet<I>) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomDFA(Random, @org.checkerframework.checker.index.qual.NonNegative int, Alphabet<I>, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomDistinctState(int) - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- RandomICAutomatonGenerator<SP,TP> - Class in net.automatalib.util.automaton.random
-
A random generator for initially connected (IC) deterministic automata.
- RandomICAutomatonGenerator() - Constructor for class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
- randomICDFA(Random, @org.checkerframework.checker.index.qual.NonNegative int, Alphabet<I>, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
-
Randomly generates an initially connected DFA (ICDFA), i.e., a DFA where all states are reachable from the initial state.
- randomInput() - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- randomMealy(Random, @org.checkerframework.checker.index.qual.NonNegative int, Alphabet<I>, Collection<? extends O>) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomMealy(Random, @org.checkerframework.checker.index.qual.NonNegative int, Alphabet<I>, Collection<? extends O>, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomMoore(Random, @org.checkerframework.checker.index.qual.NonNegative int, Alphabet<I>, Collection<? extends O>) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomMoore(Random, @org.checkerframework.checker.index.qual.NonNegative int, Alphabet<I>, Collection<? extends O>, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomOneSEVPA(Random, int, VPAlphabet<I>, double, double, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomOneSEVPA(Random, int, VPAlphabet<I>, double, double, boolean, DefaultOneSEVPA<I>) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomSBA(Random, ProceduralInputAlphabet<I>, int) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomSBA(Random, ProceduralInputAlphabet<I>, int, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomSPA(Random, ProceduralInputAlphabet<I>, int) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomSPA(Random, ProceduralInputAlphabet<I>, int, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomSPMM(Random, ProceduralInputAlphabet<I>, ProceduralOutputAlphabet<O>, int) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomSPMM(Random, ProceduralInputAlphabet<I>, ProceduralOutputAlphabet<O>, int, boolean) - Static method in class net.automatalib.util.automaton.random.RandomAutomata
- randomState() - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- randomStateProperty() - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- randomTransProperty() - Method in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- rawCopy(AutomatonCopyMethod, Automaton<S1, ? super I, T1>, Collection<? extends I>, MutableAutomaton<S2, I, T2, SP2, TP2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies an
Automaton
to aMutableAutomaton
with a compatible input alphabet, but possibly heterogeneous state and transition properties. - rawCopy(AutomatonCopyMethod, Automaton<S1, ? super I, T1>, Collection<? extends I>, MutableAutomaton<S2, I, T2, SP2, TP2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies an
Automaton
to aMutableAutomaton
with a compatible input alphabet, but possibly heterogeneous state and transition properties. - rawCopy(AutomatonCopyMethod, Automaton<S1, ? super I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies an
Automaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties. - rawCopy(AutomatonCopyMethod, Automaton<S1, ? super I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.automaton.copy.AutomatonLowLevelCopy
-
Copies an
Automaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties. - rawCopy(TSTraversalMethod, TransitionSystem<S1, ? super I, T1>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, SP2, TP2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies an
Automaton
to aMutableAutomaton
with a compatible input alphabet, but possibly heterogeneous state and transition properties. - rawCopy(TSTraversalMethod, TransitionSystem<S1, ? super I, T1>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, SP2, TP2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies an
Automaton
to aMutableAutomaton
with a compatible input alphabet, but possibly heterogeneous state and transition properties. - rawCopy(TSTraversalMethod, TransitionSystem<S1, ? super I1, T1>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies an
Automaton
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties. - rawCopy(TSTraversalMethod, TransitionSystem<S1, ? super I1, T1>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy
-
Copies an
TransitionSystem
to aMutableAutomaton
with possibly heterogeneous input alphabets and state and transition properties. - reduce(SBA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Reduces a given
SBA
to its well-matched language. - reduce(SBA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Reduces a given
SBA
to its well-matched language restricted to the symbols of the givenProceduralInputAlphabet
. - refinementRelation(ModalTransitionSystem<AS, I, ?, ?>, ModalTransitionSystem<BS, I, ?, ?>, Collection<I>) - Static method in class net.automatalib.util.ts.modal.ModalRefinement
- removeEmptyBlocks() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Removes all blocks which are empty from the block list.
- retainTransitionsWithOutput(MealyMachine<?, I, ?, O>, Alphabet<I>, Collection<? super O>) - Static method in class net.automatalib.util.automaton.transducer.MealyFilter
-
Returns a Mealy machine with all transitions removed that have an output not among the specified values.
- retainTransitionsWithOutput(MealyMachine<?, I, ?, O>, Alphabet<I>, O...) - Static method in class net.automatalib.util.automaton.transducer.MealyFilter
-
Returns a Mealy machine with all transitions removed that have an output not among the specified values.
- returnSequences - Variable in class net.automatalib.util.automaton.procedural.ATRSequences
S
- safePred(TransitionPredicate<S, I, T>, boolean) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- SBAs - Class in net.automatalib.util.automaton.procedural
-
Operations on
SBA
s. - SBAWMethodTestsIterator<I> - Class in net.automatalib.util.automaton.conformance
- SBAWMethodTestsIterator(SBA<?, I>) - Constructor for class net.automatalib.util.automaton.conformance.SBAWMethodTestsIterator
- SBAWMethodTestsIterator(SBA<?, I>, ProceduralInputAlphabet<I>) - Constructor for class net.automatalib.util.automaton.conformance.SBAWMethodTestsIterator
- SBAWMethodTestsIterator(SBA<?, I>, ProceduralInputAlphabet<I>, int) - Constructor for class net.automatalib.util.automaton.conformance.SBAWMethodTestsIterator
- SCCCollector<N> - Class in net.automatalib.util.graph.scc
- SCCCollector() - Constructor for class net.automatalib.util.graph.scc.SCCCollector
- sccId - Variable in class net.automatalib.util.graph.scc.TarjanSCCRecord
-
The id of the SCC of the node.
- SCCListener<N> - Interface in net.automatalib.util.graph.scc
- SCCs - Class in net.automatalib.util.graph.scc
-
Algorithms for finding strongly-connected components (SCCs) in a graph.
- setBlockData(int[]) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
- setBlockForState(Block[]) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
- setLastTransition(I, T, S, D) - Method in class net.automatalib.util.ts.traversal.DFRecord
- setMaxDepth(int) - Method in class net.automatalib.util.automaton.conformance.IncrementalWMethodTestsIterator
- setPosData(int[], int) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
- setPredData(int[]) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
- setPredOfsData(int[], int) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
- setSize(int, int) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
- shortestPath(IndefiniteGraph<N, E>, N, int, Predicate<? super N>) - Static method in class net.automatalib.util.graph.ShortestPaths
-
Returns a shortest path from the start node to the first node that satisfies the given predicate, if available.
- shortestPath(IndefiniteGraph<N, E>, N, int, N) - Static method in class net.automatalib.util.graph.ShortestPaths
-
Returns a shortest path from the start node to the target node, if available.
- shortestPaths(IndefiniteGraph<N, E>, Collection<? extends N>, int, Collection<?>) - Static method in class net.automatalib.util.graph.ShortestPaths
-
Returns a collection of shortest paths from the start nodes to the target nodes, if available.
- shortestPaths(IndefiniteGraph<N, E>, Collection<? extends N>, int, Predicate<? super N>) - Static method in class net.automatalib.util.graph.ShortestPaths
-
Returns a collection of shortest paths from the start nodes to all nodes that satisfy the given predicate, if available.
- shortestPaths(IndefiniteGraph<N, E>, Collection<? extends N>, int, N) - Static method in class net.automatalib.util.graph.ShortestPaths
-
Returns a collection of shortest paths from the start nodes to the target node, if available.
- shortestPaths(IndefiniteGraph<N, E>, N, int, Collection<?>) - Static method in class net.automatalib.util.graph.ShortestPaths
-
Returns a collection of shortest paths from the start node to the target nodes, if available.
- shortestPaths(IndefiniteGraph<N, E>, N, int, Predicate<? super N>) - Static method in class net.automatalib.util.graph.ShortestPaths
-
Returns a collection of shortest paths from the start node to all nodes that satisfy the given predicate, if available.
- ShortestPaths - Class in net.automatalib.util.graph
-
Unweighted shortest path search in graphs.
- shortestPathsIterator(IndefiniteGraph<N, E>, Collection<? extends N>, int, Predicate<? super N>) - Static method in class net.automatalib.util.graph.ShortestPaths
-
Returns an iterator of shortest paths from the start nodes to all nodes that satisfy the given predicate, if available.
- size() - Method in class net.automatalib.util.automaton.vpa.ProductOneSEVPA
- size() - Method in class net.automatalib.util.graph.Path
- size() - Method in class net.automatalib.util.minimizer.Block
-
Retrieves the size of this block, i.e., the number of states it contains.
- size() - Method in class net.automatalib.util.partitionrefinement.Block
-
Retrieves the size of this block.
- sourceSatisfying(Predicate<? super S>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- SPAs - Class in net.automatalib.util.automaton.procedural
-
Operations on
SPA
s. - SPATestsIterator<I> - Class in net.automatalib.util.automaton.conformance
- SPATestsIterator(SPA<?, I>, BiFunction<DFA<?, I>, Collection<I>, Iterator<Word<I>>>) - Constructor for class net.automatalib.util.automaton.conformance.SPATestsIterator
- SPATestsIterator(SPA<?, I>, ProceduralInputAlphabet<I>, BiFunction<DFA<?, I>, Collection<I>, Iterator<Word<I>>>) - Constructor for class net.automatalib.util.automaton.conformance.SPATestsIterator
- spList - Variable in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- split(int) - Method in class net.automatalib.util.partitionrefinement.Block
-
Splits this block, if applicable.
- spMapping - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- SPMMs - Class in net.automatalib.util.automaton.procedural
-
Operations on
SPMM
s. - SPMMWMethodTestsIterator<I,O> - Class in net.automatalib.util.automaton.conformance
-
A conformance test iterator for
SPMM
s that is based on the W-method. - SPMMWMethodTestsIterator(SPMM<?, I, ?, O>) - Constructor for class net.automatalib.util.automaton.conformance.SPMMWMethodTestsIterator
- SPMMWMethodTestsIterator(SPMM<?, I, ?, O>, ProceduralInputAlphabet<I>) - Constructor for class net.automatalib.util.automaton.conformance.SPMMWMethodTestsIterator
- SPMMWMethodTestsIterator(SPMM<?, I, ?, O>, ProceduralInputAlphabet<I>, int) - Constructor for class net.automatalib.util.automaton.conformance.SPMMWMethodTestsIterator
- SSSPResult<N,E> - Interface in net.automatalib.util.graph.sssp
-
Result interface for the single-source shortest path (SSSP) problem.
- startExploration(N, D) - Method in interface net.automatalib.util.graph.traversal.GraphTraversalVisitor
-
Called when the exploration of a node is started.
- startExploration(N, TarjanSCCRecord) - Method in class net.automatalib.util.graph.scc.TarjanSCCVisitor
- startExploration(S, D) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor
-
Called when the exploration of a state is started.
- state - Variable in class net.automatalib.util.ts.traversal.DFRecord.LastTransition
- state - Variable in class net.automatalib.util.ts.TS.TransRef
- STATE_BY_STATE - Static variable in interface net.automatalib.util.automaton.copy.AutomatonCopyMethod
- stateCharacterizingSet(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Collection<? extends I>, S) - Static method in class net.automatalib.util.automaton.Automata
-
Computes a characterizing set for a single state, and returns it as a
List
. - stateCharacterizingSet(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Collection<? extends I>, S, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.Automata
-
Computes a characterizing set for a single state.
- stateCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
-
Convenient method for computing a state cover.
- stateCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Computes a state cover for a given automaton.
- stateCoverIterator(DeterministicAutomaton<?, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Returns an iterator for the sequences of a state cover.
- StateEquivalence - Class in net.automatalib.util.automaton.ads
-
A utility class for computing an adaptive distinguishing sequence by means of solving the state equivalence problems, i.e. computing and ADS for two states only.
- stateFilter - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- stateMapping - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- stateProperties(UniversalTransitionSystem<S, ?, ?, SP, ?>) - Static method in class net.automatalib.util.ts.TS
- states - Variable in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- StateSignature - Class in net.automatalib.util.partitionrefinement
-
Utility class for constructing state signatures used for classifying states during
PaigeTarjanInitializers
. - statesInBlockIterator(Block) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Retrieves an iterator for the contents of the given block.
- statesInBlockSpliterator(Block) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
-
Retrieves a spliterator for the contents of the given block.
- StringSymbolMapper<AI> - Class in net.automatalib.util.automaton.vpa
-
A default implementation that maps abstract input symbol to their
String
representations while adding an incrementing number to mappedcall symbols
. - StringSymbolMapper() - Constructor for class net.automatalib.util.automaton.vpa.StringSymbolMapper
- structuralCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
-
Convenient method for computing a structural cover.
- structuralCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Computes a structural cover for a given automaton.
- SubsequentialTransducers - Class in net.automatalib.util.automaton.transducer
-
Utility methods of
SubsequentialTransducer
s. - SymbolMapper<AI,CI> - Interface in net.automatalib.util.automaton.vpa
T
- TarjanSCCRecord - Class in net.automatalib.util.graph.scc
- TarjanSCCVisitor<N,E> - Class in net.automatalib.util.graph.scc
-
Depth-first traversal visitor realizing Tarjan's algorithm for finding all strongly-connected components (SCCs) in a graph.
- TarjanSCCVisitor(Graph<N, E>, SCCListener<N>) - Constructor for class net.automatalib.util.graph.scc.TarjanSCCVisitor
-
Constructor.
- terminatingSequences - Variable in class net.automatalib.util.automaton.procedural.ATRSequences
- terminatingSequences - Variable in class net.automatalib.util.automaton.procedural.ATSequences
- testEquivalence(SBA<?, I>, SBA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Checks if the two given
SBA
s are equivalent, i.e. whether there exists aseparating word
for them. - testEquivalence(SPA<?, I>, SPA<?, I>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
-
Checks if the two given
SPA
s are equivalent, i.e. whether there exists aseparating word
for them. - testEquivalence(SPMM<?, I, ?, O>, SPMM<?, I, ?, O>, ProceduralInputAlphabet<I>) - Static method in class net.automatalib.util.automaton.procedural.SPMMs
-
Checks if the two given
SPMM
s are equivalent, i.e. whether there exists aseparating word
for them. - testEquivalence(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
-
Tests whether two automata are equivalent, i.e. whether there exists a
separating word
for the two given automata. - testEquivalence(OneSEVPA<?, I>, OneSEVPA<?, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Tests whether two SEVPAs are equivalent, i.e. whether there exists a
separating word
for the two given SEVPAs. - to(Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__1
- to(Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- to(Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__3
- to(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__2
- to(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__5
- to(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__1
- to(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- to(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- to(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__2
- to(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__5
- to(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__6
- to(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__8
- to(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__2
- to(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__5
- to(Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__1
- to(Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- to(Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__3
- to(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__1
- to(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- to(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- toCFMPS(SBA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SBAs
-
Returns a
ContextFreeModalProcessSystem
-based view on the language of a givenSBA
such that there exists aw
-labeled path in the returned CFMPS if and only ifw
is accepted by the givenSBA
. - toCFMPS(SPA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
-
Returns a
ContextFreeModalProcessSystem
-based view on the language of a givenSPA
such that there exists aw
-labeled path to the final node of the returned CFMPS' main procedure if and only ifw
is accepted by the givenSPA
. - toDeterministic(PaigeTarjan, AutomatonCreator<A, I>, Alphabet<I>, SimpleDeterministicAutomaton.FullIntAbstraction, IntFunction<? extends SP>, BiIntFunction<? extends TP>, boolean) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanExtractors
-
Translates the results of the coarsest stable partition computation into a deterministic automaton.
- toNodeList(List<E>, Graph<N, E>, N) - Static method in class net.automatalib.util.graph.Graphs
-
Converts a list of edges into a corresponding list of nodes.
- toNSEVPA(SPA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
- toOneSEVPA(SPA<?, I>) - Static method in class net.automatalib.util.automaton.procedural.SPAs
- toOnwardSST(SubsequentialTransducer<S1, I, T1, O>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.transducer.SubsequentialTransducers
-
Constructs a new onward subsequential transducer for a given
SST
. - toOnwardSST(SubsequentialTransducer<S1, I, T1, O>, Collection<? extends I>, A, boolean) - Static method in class net.automatalib.util.automaton.transducer.SubsequentialTransducers
-
Constructs a new onward subsequential transducer for a given
SST
. - toSPA(OneSEVPA<?, AI>, VPAlphabet<AI>, CI, SymbolMapper<AI, CI>, boolean) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Converts a given SEVPA into an SPA by concretizing the (abstract) behavior of the SEVPA into the (concrete) behavior of an SPA which can be described by the copy-rule semantics of (instrumented) context-free grammars.
- tpList - Variable in class net.automatalib.util.automaton.random.RandomAutomatonGenerator
- tpMapping - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- Transducers - Class in net.automatalib.util.ts.transducer
- transFilter - Variable in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
- transition - Variable in class net.automatalib.util.ts.traversal.DFRecord.LastTransition
- transition - Variable in class net.automatalib.util.ts.TS.TransRef
- transitionCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.Automata
-
Convenient method for computing a state cover.
- transitionCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Computes a transition cover for a given automaton.
- transitionCoverIterator(DeterministicAutomaton<?, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automaton.cover.Covers
-
Returns an iterator for the sequences of a transition cover.
- TransitionPredicates - Class in net.automatalib.util.automaton.predicate
- transitionProperties(UniversalTransitionSystem<?, ?, T, ?, TP>) - Static method in class net.automatalib.util.ts.TS
- transitionSatisfying(Predicate<? super T>) - Static method in class net.automatalib.util.automaton.predicate.TransitionPredicates
- TransRef(S, I, T) - Constructor for class net.automatalib.util.ts.TS.TransRef
- TraversalOrder - Enum in net.automatalib.util.traversal
- traverse(TransitionSystem<S, ? super I, T>, int, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Method in interface net.automatalib.util.ts.traversal.TSTraversalMethod
- traverse(TraversalOrder, IndefiniteGraph<N, E>, int, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a given order.
- traverse(TraversalOrder, IndefiniteGraph<N, E>, int, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a given order.
- traverse(TraversalOrder, IndefiniteGraph<N, E>, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a given order.
- traverse(TraversalOrder, IndefiniteGraph<N, E>, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graph.traversal.GraphTraversal
-
Traverses the given graph in a given order.
- traverse(TraversalOrder, TransitionSystem<S, ? super I, T>, int, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Traverses the given transition system in a given order.
- traverse(TraversalOrder, TransitionSystem<S, ? super I, T>, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
-
Traverses the given transition system in a given order.
- TS - Class in net.automatalib.util.ts
- TS.TransRef<S,I,T> - Class in net.automatalib.util.ts
- ts1 - Variable in class net.automatalib.util.ts.comp.DTSComposition
- ts1 - Variable in class net.automatalib.util.ts.comp.TSComposition
- ts2 - Variable in class net.automatalib.util.ts.comp.DTSComposition
- ts2 - Variable in class net.automatalib.util.ts.comp.TSComposition
- TSComposition<S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>> - Class in net.automatalib.util.ts.comp
- TSComposition(TS1, TS2) - Constructor for class net.automatalib.util.ts.comp.TSComposition
-
Constructor.
- TSCompositions - Class in net.automatalib.util.ts.comp
- TSCopy - Class in net.automatalib.util.ts.copy
- TSCopyVisitor<S1,I1,T1,S2,I2,T2,SP2,TP2> - Class in net.automatalib.util.ts.copy
- TSCopyVisitor(TransitionSystem<S1, ? super I1, T1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Constructor for class net.automatalib.util.ts.copy.TSCopyVisitor
- TSTraversal - Class in net.automatalib.util.ts.traversal
- TSTraversalAction - Enum in net.automatalib.util.ts.traversal
-
The type of
TSTraversalAction
to be performed. - TSTraversalMethod - Interface in net.automatalib.util.ts.traversal
- TSTraversalVisitor<S,I,T,D> - Interface in net.automatalib.util.ts.traversal
-
Visitor interface for transition system traversals.
U
- undefinedInputs(TransitionSystem<S, I, ?>, S, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
- undefinedInputsIterator(TransitionSystem<S, I, ?>, S, Iterator<? extends I>) - Static method in class net.automatalib.util.ts.TS
- UndefinedInputsIterator<S,I> - Class in net.automatalib.util.ts.iterator
- UndefinedInputsIterator(TransitionSystem<S, I, ?>, S, Iterator<? extends I>) - Constructor for class net.automatalib.util.ts.iterator.UndefinedInputsIterator
- update(UniversalDeterministicAutomaton<?, I, ?, ?, ?>) - Method in class net.automatalib.util.automaton.conformance.IncrementalWMethodTestsIterator
- updateInitials() - Method in class net.automatalib.util.automaton.copy.AbstractLowLevelAutomatonCopier
V
- valueOf(String) - Static method in enum net.automatalib.util.automaton.ads.BacktrackingSearch.CostAggregator
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization.PruningMode
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum net.automatalib.util.graph.traversal.GraphTraversalAction
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum net.automatalib.util.partitionrefinement.AutomatonInitialPartitioning
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum net.automatalib.util.partitionrefinement.PaigeTarjan.WorklistPolicy
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum net.automatalib.util.traversal.TraversalOrder
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum net.automatalib.util.traversal.VisitedState
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum net.automatalib.util.ts.traversal.TSTraversalAction
-
Returns the enum constant of this type with the specified name.
- values() - Static method in enum net.automatalib.util.automaton.ads.BacktrackingSearch.CostAggregator
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum net.automatalib.util.automaton.minimizer.hopcroft.HopcroftMinimization.PruningMode
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum net.automatalib.util.graph.traversal.GraphTraversalAction
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Method in class net.automatalib.util.minimizer.BlockMap
-
Retrieves all values that are stored in this map.
- values() - Static method in enum net.automatalib.util.partitionrefinement.AutomatonInitialPartitioning
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum net.automatalib.util.partitionrefinement.PaigeTarjan.WorklistPolicy
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum net.automatalib.util.traversal.TraversalOrder
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum net.automatalib.util.traversal.VisitedState
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum net.automatalib.util.ts.traversal.TSTraversalAction
-
Returns an array containing the constants of this enum type, in the order they are declared.
- VISITED - net.automatalib.util.traversal.VisitedState
-
Nodes that have already been visited.
- VisitedState - Enum in net.automatalib.util.traversal
-
Enum to use for indicating if a node/state has been visited.
W
- withAccepting(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__1
- withAccepting(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__4
- withAccepting(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__6
- withAccepting(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder
- withAccepting(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- withAccepting(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- withAccepting(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder
- withAccepting(Object, Object...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__1
- withAccepting(Object, Object...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__4
- withAccepting(Object, Object...) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__6
- withAccepting(Object, Object...) - Method in class net.automatalib.util.automaton.builder.DFABuilder
- withAccepting(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- withAccepting(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- withAccepting(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder.DFABuilder__4
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.DFABuilder
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.FSABuilder
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__4
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.MealyBuilder
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__4
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilder
- withInitial(Object) - Method in class net.automatalib.util.automaton.builder.MooreBuilderImpl
- withInitial(Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- withInitial(Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder
- withInitial(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__2
- withInitial(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder.FSABuilder__3
- withInitial(Object, Object...) - Method in class net.automatalib.util.automaton.builder.FSABuilder
- withInitial(Object, O) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__4
- withInitial(Object, O) - Method in class net.automatalib.util.automaton.builder.MooreBuilder
- withInitial(Object, O) - Method in class net.automatalib.util.automaton.builder.MooreBuilderImpl
- withOutput(Object, O) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__1
- withOutput(Object, O) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__4
- withOutput(Object, O) - Method in class net.automatalib.util.automaton.builder.MooreBuilder.MooreBuilder__6
- withOutput(Object, O) - Method in class net.automatalib.util.automaton.builder.MooreBuilder
- withOutput(Object, O) - Method in class net.automatalib.util.automaton.builder.MooreBuilderImpl
- withOutput(O) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__2
- withOutput(O) - Method in class net.automatalib.util.automaton.builder.MealyBuilder.MealyBuilder__6
- withProperty(TP) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__1
- withProperty(TP) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- withStateProperties(Collection<? extends SP>) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Sets the possible state properties, and returns
this
. - withStateProperties(Function<? super Random, ? extends SP>) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Sets the function for supplying state properties, and returns
this
. - withStateProperties(Supplier<? extends SP>) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Sets the supplier for state properties, and returns
this
. - withStateProperties(SP...) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Sets the possible state properties, and returns
this
. - withStateProperty(SP, Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- withStateProperty(SP, Object) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder
- withStateProperty(SP, Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder.AutomatonBuilder__2
- withStateProperty(SP, Object, Object...) - Method in class net.automatalib.util.automaton.builder.AutomatonBuilder
- withTransitionProperties(Collection<? extends TP>) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Sets the possible transition properties, and returns
this
. - withTransitionProperties(Function<? super Random, ? extends TP>) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Sets the function for supplying transition properties, and returns
this
. - withTransitionProperties(Supplier<? extends TP>) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Sets the supplier for transition properties, and returns
this
. - withTransitionProperties(TP...) - Method in class net.automatalib.util.automaton.random.RandomICAutomatonGenerator
-
Sets the possible transition properties, and returns
this
. - WMethodTestsIterator<I> - Class in net.automatalib.util.automaton.conformance
-
Iterator that returns test words generated by the W method.
- WMethodTestsIterator(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Constructor for class net.automatalib.util.automaton.conformance.WMethodTestsIterator
-
Convenience-constructor for
WMethodTestsIterator(UniversalDeterministicAutomaton, Collection, int)
that selects0
asmaxDepth
. - WMethodTestsIterator(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>, int) - Constructor for class net.automatalib.util.automaton.conformance.WMethodTestsIterator
-
Constructor.
- WpMethodTestsIterator<I> - Class in net.automatalib.util.automaton.conformance
-
Iterator that returns test words generated by the partial W method.
- WpMethodTestsIterator(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Constructor for class net.automatalib.util.automaton.conformance.WpMethodTestsIterator
-
Convenience-constructor for
WpMethodTestsIterator(UniversalDeterministicAutomaton, Collection, int)
that selects0
asmaxDepth
. - WpMethodTestsIterator(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>, int) - Constructor for class net.automatalib.util.automaton.conformance.WpMethodTestsIterator
-
Constructor.
X
- xor(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the exclusive-or ("xor") of two DFA, and stores the result in a given mutable DFA.
- xor(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.DFAs
-
Calculates the exclusive-or ("xor") of two DFA, and returns the result as a new DFA.
- xor(NFA<?, I>, NFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the exclusive-or ("xor") of two NFAs, and stores the result in a given mutable NFA.
- xor(NFA<?, I>, NFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automaton.fsa.NFAs
-
Calculates the exclusive-or ("xor") of two NFAs, and returns the result as a new NFA.
- xor(OneSEVPA<L1, I>, OneSEVPA<L2, I>, VPAlphabet<I>) - Static method in class net.automatalib.util.automaton.vpa.OneSEVPAs
-
Returns a view on the exclusive-or ("xor") of two
OneSEVPA
s. - XOR - Static variable in interface net.automatalib.util.ts.acceptor.AcceptanceCombiner
All Classes All Packages