All Classes Interface Summary Class Summary Enum Summary Exception Summary
| Class |
Description |
| AbstractLowLevelAutomatonCopier<S1,I1,T1,S2,I2,T2,SP2,TP2,TS1 extends TransitionSystem<S1,? super I1,T1>> |
|
| AcceptanceCombiner |
|
| Acceptors |
|
| ADS |
General purpose facade for computing adaptive distinguishing sequences.
|
| ADSUtil |
Utility class, that offers some operations revolving around adaptive distinguishing sequences.
|
| AllDefinedInputsIterator<S,I> |
|
| AllUndefinedInputsIterator<S,I> |
|
| APSPResult<N,E> |
Result interface for the all pairs shortest paths problem.
|
| ATRSequences<I> |
A data class for aggregating access sequences, terminating sequences, and return sequences.
|
| ATSequences<I> |
A data class for aggregating access sequences and terminating sequences.
|
| Automata |
|
| AutomatonBuilder<S,I,T,SP,TP,A extends MutableAutomaton<S,? super I,T,? super SP,? super TP>> |
|
| AutomatonBuilders |
Fluent interface automaton builders.
|
| AutomatonCopyMethod |
|
| AutomatonInitialPartitioning |
This enum allows to conveniently specify how the states of a deterministic automaton are initially partitioned when
initializing the partition refinement data structure.
|
| AutomatonLowLevelCopy |
|
| BacktrackingSearch |
A class containing methods for computing adaptive distinguishing sequences (for arbitrary sets of states) by means of
a backtracking approach.
|
| BacktrackingSearch.CostAggregator |
Utility enum, that allows to specify the optimization criterion when performing and optimal ADS search.
|
| Bisimulation |
|
| Block<S,L> |
A block in the partition calculated during minimization.
|
| Block |
A block (i.e., partition class) that is maintained during the Paige/Tarjan partition refinement algorithm (see PaigeTarjan). |
| BlockAutomaton<S,L> |
A "block automaton", i.e. an automaton-style representation of the minimization result in which each block forms a
state.
|
| BlockEdge<S,L> |
|
| BlockMap<V> |
Class for associating arbitrary values with the blocks of a minimization result.
|
| CharacterizingSets |
Operations for calculating characterizing sets.
|
| Covers |
|
| DefinedInputsIterator<S,I> |
|
| DeterministicEquivalenceTest |
|
| DFABuilder<S,I,A extends MutableDFA<S,? super I>> |
|
| DFAs |
|
| DFRecord<S,I,T,D> |
|
| DFRecord.LastTransition<S,I,T,D> |
|
| DijkstraSSSP<N,E> |
Implementation of Dijkstras algorithm for the single-source shortest path problem.
|
| DTSComposition<S1,S2,I,T1,T2,TS1 extends DeterministicTransitionSystem<S1,I,T1>,TS2 extends DeterministicTransitionSystem<S2,I,T2>> |
|
| FloydWarshallAPSP<N,E> |
Implementation of the Floyd-Warshall dynamic programming algorithm for the all pairs shortest paths problem.
|
| FSABuilder<S,I,A extends MutableFSA<S,? super I>> |
|
| GraphCopy |
|
| Graphs |
|
| GraphTraversal |
|
| GraphTraversalAction |
|
| GraphTraversalVisitor<N,E,D> |
Visitor interface for graph traversals.
|
| HopcroftMinimization |
Versions of Hopcroft's minimization algorithm for deterministic finite automata.
|
| HopcroftMinimization.PruningMode |
Allows for controlling how automata are pruned during minimization.
|
| IllegalConjunctionException |
|
| IncrementalWMethodTestsIterator<I> |
An iterator that enumerates the test cases as obtained through the W method conformance test in an incremental
fashion.
|
| LeeYannakakis |
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).
|
| LowLevelAutomatonCopier<S1,S2> |
|
| LYResult<S,I,O> |
Utility class that holds some information aggregated during the ADS computation of LeeYannakakis. |
| MealyBuilder<S,I,T,O,A extends MutableMealyMachine<S,? super I,T,? super O>> |
|
| MealyFilter |
Various utility methods to filter Mealy machines.
|
| MealyMachines |
|
| MinimizationResult<S,L> |
The result structure of a minimization process.
|
| Minimizer<S,L> |
Automaton minimizer.
|
| ModalRefinement |
|
| MooreBuilder<S,I,T,O,A extends MutableMooreMachine<S,? super I,T,? super O>> |
|
| MooreBuilderImpl<S,I,T,O,A extends MutableMooreMachine<S,? super I,T,? super O>> |
|
| MTSs |
|
| MutableDFAs |
|
| MutableMealyMachines |
|
| NearLinearEquivalenceTest |
|
| NFAs |
|
| OneSEVPAMinimizer |
A Paige/Tarjan partition refinement based minimizer for OneSEVPAs. |
| OneSEVPAs |
|
| PaigeTarjan |
An implementation of the Paige/Tarjan partition refinement algorithm.
|
| PaigeTarjan.WorklistPolicy |
Determines how the worklist is managed, i.e., where newly created blocks are inserted.
|
| PaigeTarjanExtractors |
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 |
This class provides several methods to initialize a PaigeTarjan partition refinement data structure from
common sources, e.g., automata. |
| PaigeTarjanMinimization |
A utility class that offers shorthand methods for minimizing automata using the partition refinement approach of
PaigeTarjan. |
| Path<N,E> |
|
| ProductOneSEVPA<L1,L2,I> |
Production automaton that allows to join two given OneSEVPAs. |
| PropertyEdgeWeights<E> |
|
| RandomAutomata |
|
| RandomAutomatonGenerator<S,I,T,SP,TP,A extends MutableAutomaton<S,I,T,SP,TP>> |
|
| RandomDeterministicAutomatonGenerator<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
|
| RandomICAutomatonGenerator<SP,TP> |
A random generator for initially connected (IC) deterministic automata.
|
| SBAs |
|
| SBAWMethodTestsIterator<I> |
A conformance test iterator for SBAs that is based on the W-method. |
| SCCCollector<N> |
|
| SCCListener<N> |
|
| SCCs |
Algorithms for finding strongly-connected components (SCCs) in a graph.
|
| ShortestPaths |
Unweighted shortest path search in graphs.
|
| SPAs |
|
| SPATestsIterator<I> |
A conformance test iterator for SPAs that applies a given regular conformance test to each procedure of the
SPA. |
| SPMMs |
|
| SPMMWMethodTestsIterator<I,O> |
A conformance test iterator for SPMMs that is based on the W-method. |
| SSSPResult<N,E> |
Result interface for the single-source shortest path (SSSP) problem.
|
| StateEquivalence |
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.
|
| StateSignature |
|
| StringSymbolMapper<AI> |
A default implementation that maps abstract input symbol to their String representations while adding an
incrementing number to mapped call symbols. |
| SubsequentialTransducers |
|
| SymbolMapper<AI,CI> |
An interface for mapping (abstract) SEVPA input symbols to concrete SPA input symbols. |
| TarjanSCCRecord |
|
| TarjanSCCVisitor<N,E> |
Depth-first traversal visitor realizing Tarjan's algorithm for finding all strongly-connected components (SCCs) in a
graph.
|
| Transducers |
|
| TransitionPredicates |
|
| TraversalOrder |
|
| TS |
|
| TS.TransRef<S,I,T> |
|
| TSComposition<S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>> |
|
| TSCompositions |
|
| TSCopy |
|
| TSCopyVisitor<S1,I1,T1,S2,I2,T2,SP2,TP2> |
|
| TSTraversal |
|
| TSTraversalAction |
|
| TSTraversalMethod |
|
| TSTraversalVisitor<S,I,T,D> |
Visitor interface for transition system traversals.
|
| UndefinedInputsIterator<S,I> |
|
| VisitedState |
Enum to use for indicating if a node/state has been visited.
|
| WMethodTestsIterator<I> |
Iterator that returns test words generated by the W method.
|
| WpMethodTestsIterator<I> |
Iterator that returns test words generated by the partial W method.
|