All Classes Interface Summary Class Summary Enum Summary Exception Summary
| Class |
Description |
| AbstractProcessTreeModelConnection<Parameters> |
|
| And2Or |
|
| Arrays |
|
| ArrayUtilities |
|
| AtomicResult |
|
| AttributeClassifiers |
|
| AttributeClassifiers.AttributeClassifier |
A class that represents either a classifier or an attribute.
|
| AttributesInfo |
|
| BaseCaseFinder |
|
| BaseCaseFinderIM |
|
| BaseCaseFinderIMi |
|
| BaseCaseFinderIMiEmptyLog |
|
| BaseCaseFinderIMiEmptyTrace |
|
| BaseCaseFinderIMiSingleActivity |
|
| BoundsPopupMenuListener |
This class will change the bounds of the JComboBox popup menu to support
different functionality.
|
| ClassifierChooser |
Multi-selection combobox to select a classifier.
|
| Classifiers |
|
| Classifiers.ClassifierWrapper |
|
| Cliques |
"Solve" the clique problem, but polynomially on arbitrary graphs.
|
| CombineLoop |
|
| CombineParallel |
|
| CombineSequence |
|
| CombineXor |
|
| Components<V> |
|
| ConcurrentOptionalOrLog |
|
| ConcurrentOptionalOrLogInfo |
|
| ConcurrentOptionalOrLogMerger |
|
| ConnectedComponents<V> |
|
| ConnectedComponents2 |
New implementation of connected components.
|
| Cut |
|
| Cut.Operator |
|
| CutFinder |
|
| CutFinderEKS |
|
| CutFinderIM |
|
| CutFinderIMaConcurrent |
Detects concurrent cuts, and takes care to not discover cuts that might
introduce false taus.
|
| CutFinderIMaConcurrentOptionalOr |
|
| CutFinderIMaInterleaved |
Detect an interleaved cut.
|
| CutFinderIMc |
|
| CutFinderIMConcurrent |
|
| CutFinderIMConcurrentWithMinimumSelfDistance |
|
| CutFinderIMExclusiveChoice |
|
| CutFinderIMf |
|
| CutFinderIMfa |
|
| CutFinderIMflc |
|
| CutFinderIMinInfo |
|
| CutFinderIMlc |
|
| CutFinderIMlcConcurrent |
|
| CutFinderIMlcInterleaved |
|
| CutFinderIMLoop |
|
| CutFinderIMSequence |
|
| CutFinderIMSequenceReachability |
Notice that this approach does not work on cyclic graphs.
|
| CutFinderIMSequenceStrict |
|
| DebugProbabilities |
|
| Decuple<A,B,C,D,E,F,G,H,I,J> |
|
| DetectInterleaved |
|
| Dfg |
|
| DfgBaseCaseFinder |
|
| DfgCutFinder |
|
| DfgCutFinderCombination |
|
| DfgCutFinderMergeParallelGraph |
|
| DfgCutFinderNoiseFiltering |
|
| DfgCutFinderSimple |
|
| DfgExportPlugin |
|
| DfgFallThrough |
|
| DfgFallThroughCombination |
|
| DfgFallThroughFlower |
|
| DfgFallThroughStrictTauLoop |
|
| DfgImpl |
|
| DfgImportPlugin |
|
| DfgMiner |
|
| DfgMinerState |
|
| DfgMiningParameters |
|
| DfgMiningParametersIMcd |
|
| DfgMiningParametersIMd |
|
| DfgMiningParametersIMfd |
|
| DfgMiningParametersIMiD |
Deprecated. |
| DfgMiningParametersIMinD |
|
| DfgMiningParametersPartialOrder |
|
| DfgMiningParametersStreams |
|
| DfgSplitter |
|
| DfgSplitter.DfgSplitResult |
|
| DistanceEuclidian |
|
| EdgeIterable |
|
| EfficientTree |
Class to store a process tree memory efficient and perform operations cpu
efficient.
|
| EfficientTree.NodeType |
|
| EfficientTree2AcceptingPetriNet |
|
| EfficientTree2AcceptingPetriNetPlugin |
|
| EfficientTree2HumanReadableString |
|
| EfficientTree2processTree |
|
| EfficientTree2processTreePlugin |
|
| EfficientTreeEditor |
|
| EfficientTreeExportPlugin |
|
| EfficientTreeFactory |
|
| EfficientTreeHash |
|
| EfficientTreeImpl |
|
| EfficientTreeImportPlugin |
|
| EfficientTreeMetrics |
|
| EfficientTreeReduce |
|
| EfficientTreeReduce.ReductionFailedException |
|
| EfficientTreeReduceParameters |
|
| EfficientTreeReduceParametersDuplicates |
|
| EfficientTreeReduceParametersForPetriNet |
|
| EfficientTreeReductionRule |
|
| EfficientTreeUtils |
|
| Exhaustive |
|
| ExpandCollapsedProcessTree |
|
| ExpandProcessTree |
|
| FallThrough |
|
| FallThroughActivityConcurrent |
|
| FallThroughActivityOncePerTraceConcurrent |
Try to exclude a single activity, given that it occurs precisely once per
trace.
|
| FallThroughFlowerWithEpsilon |
|
| FallThroughFlowerWithoutEpsilon |
|
| FallThroughIM |
|
| FallThroughIMlc |
|
| FallThroughSaveLog |
|
| FallThroughTauLoop |
|
| FallThroughTauLoopStrict |
|
| FilterDfgPlugin |
|
| FlowerMiner |
|
| FlowerMinerDfg |
|
| FootPrint |
|
| FootPrint.DfgUnfoldedNode |
|
| Function<I,O> |
|
| Graph<V> |
|
| GraphFactory |
|
| GraphImplLinearEdge<V> |
|
| GraphImplLinearEdgeImportOptimised<V> |
|
| GraphImplQuadratic<V> |
|
| IM |
|
| IMd |
|
| IMdMiningDialog |
|
| IMdPetriNet |
|
| IMdProcessTree |
|
| IMLog |
|
| IMLog2IMLogInfo |
|
| IMLog2IMLogInfoDefault |
|
| IMLog2IMLogInfoLifeCycle |
|
| IMLog2IMLogInfoStartEndComplete |
|
| IMLogImpl |
|
| IMLogInfo |
|
| IMLogStartEndComplete |
|
| IMMiningDialog |
|
| IMPetriNet |
|
| IMProcessTree |
|
| IMTrace |
|
| IMTree |
|
| InlineTree |
|
| IntComponents |
|
| IntConnectedComponents |
New implementation of connected components.
|
| IntDfg |
|
| IntDfgImpl |
|
| IntegerMultiSet |
|
| InterchangeablePlaces |
Reduce a Petri net using the rule that if two silent transitions undo each
other's effects, then their places can be merged.
|
| Interleaved |
|
| IntGraph |
|
| IntGraphImplQuadratic |
|
| IntShortLanguage |
|
| IntStronglyConnectedComponents |
|
| JobList |
|
| JobListBlocking |
|
| JobListConcurrent |
|
| LifeCycleClassifier |
|
| LifeCycles |
|
| LogSplitter |
|
| LogSplitter.LogSplitResult |
|
| LogSplitterCombination |
|
| LogSplitterIMi |
|
| LogSplitterIMlc |
|
| LogSplitterIMpt |
|
| LogSplitterInterleavedFiltering |
|
| LogSplitterLoop |
|
| LogSplitterLoopIMpt |
|
| LogSplitterMaybeInterleaved |
|
| LogSplitterOr |
|
| LogSplitterParallel |
|
| LogSplitterSequenceFiltering |
|
| LogSplitterSequenceFilteringIMpt |
|
| LogSplitterXor |
Splits the log by putting each event into its sigma.
|
| LogSplitterXorFiltering |
|
| LongBitSet |
Obtained from http://java-performance.info/bit-sets/
|
| LoopATauTau2flower |
|
| LoopLoop |
|
| LoopTau |
This reduction rule makes the tree longer.
|
| LoopTauATau2flower |
Deprecated. |
| Matrix<X extends java.lang.Comparable<X>,Y extends java.lang.Number> |
|
| Maybe<X> |
|
| MaybeInterleaved |
|
| MaybeString |
|
| Miner |
Do not directly call this class, use one of the plug-ins from the
InductiveMiner.plugins folder
|
| MinerMetrics |
|
| MinerState |
|
| MinerStateBase |
|
| MiningParameters |
|
| MiningParametersEKS |
|
| MiningParametersIM |
|
| MiningParametersIMa |
|
| MiningParametersIMc |
|
| MiningParametersIMcpt |
|
| MiningParametersIMf |
|
| MiningParametersIMfa |
|
| MiningParametersIMflc |
|
| MiningParametersIMfpt |
|
| MiningParametersIMi |
Deprecated. |
| MiningParametersIMilc |
Deprecated. |
| MiningParametersIMin |
Deprecated. |
| MiningParametersIMlc |
|
| MiningParametersIMpt |
|
| MiningParametersThesisIM |
Deprecated. |
| MultiComboBox<E> |
|
| MultiIntSet |
|
| MultiSet<X> |
|
| MurataESTkeepLanguage |
Reduce a Petri net using Murata's Fusion of Elimination of Self-Loop
Transitions.
|
| MurataFPPkeepLanguage |
Reduce a Petri net using Murata's Fusion of Parallel Places rule.
|
| MurataFPTkeepLanguage |
Reduce a Petri net using Murata's Fusion of Series Transitions.
|
| MurataFSP1keepLanguage |
Reduce a Petri net using Murata's Fusion of Series Places rule.
|
| MurataFSP2keepLanguage |
Reduce a Petri net using Murata's Fusion of Series Places rule.
|
| MurataFST1keepLanguage |
Reduce a Petri net using Murata's Fusion of Series Transitions.
|
| MurataFST2keepLanguage |
Reduce a Petri net using Murata's Fusion of Series Transitions.
|
| Nonuple<A,B,C,D,E,F,G,H,I> |
|
| NormalisedIntComponents |
Assumes that the nodes are numbered [0..n].
|
| NormalisedIntConnectedComponents |
New implementation of connected components.
|
| NormalisedIntDfg |
All indices in this class should be normalised, i.e.
|
| NormalisedIntDfgImpl |
|
| NormalisedIntGraph |
Assumes that all nodes are normalised, i.e.
|
| NormalisedIntGraphImplQuadratic |
|
| NormalisedIntStronglyConnectedComponents |
|
| OrXorTau |
|
| Pair<L,R> |
|
| PetrinetImplExt |
|
| PostProcessor |
|
| PostProcessorInterleaved |
replace interleaved nodes if necessary
|
| PreProcessLogForLifeCyclesPlugin |
|
| Probabilities |
|
| ProbabilitiesEstimatedZ |
|
| ProbabilitiesNoise |
|
| ProbabilitiesUnit |
|
| ProcessTree2EfficientTree |
|
| ProcessTree2EfficientTreePlugin |
|
| ProcessTreeModelConnection |
|
| ProcessTreeNodiser |
|
| ProcessTreeNodiser.NodeType |
|
| ProcessTreeParser |
|
| ProcessTreeTokeniser |
The StreamTokenizer class takes an input stream and parses it
into "tokens", allowing the tokens to be read one at a time.
|
| Quadruple<A,B,C,D> |
|
| Quintuple<A,B,C,D,E> |
|
| Reachability |
|
| ReduceAcceptingPetriNetKeepLanguage |
|
| ReduceAcceptingPetriNetPlugin |
|
| ReduceTree |
|
| SameOperator |
|
| SATResult |
|
| SATSolve |
|
| SATSolveLoop |
|
| SATSolveParallel |
|
| SATSolveSequence |
|
| SATSolveSingle |
|
| SATSolveSingle.Edge |
|
| SATSolveSingle.Node |
|
| SATSolveSingle.Var |
|
| SATSolveSingleLoop |
|
| SATSolveSingleParallel |
|
| SATSolveSingleSequence |
|
| SATSolveSingleXor |
|
| SATSolveXor |
|
| Septuple<A,B,C,D,E,F,G> |
|
| Sets |
|
| Sextuple<A,B,C,D,E,F> |
|
| SimpleDfgBaseCaseFinder |
|
| SimpleDfgSplitter |
|
| SingleChild |
|
| StronglyConnectedComponents<X> |
|
| TauChildOfOr |
|
| TauChildOfSeqAndInt |
|
| TauMiner |
|
| ThreadPoolMiner |
|
| TraceMiner |
|
| TransitiveClosure |
|
| Triple<A,B,C> |
|
| UndirectedGraph<V> |
|
| UndirectedSimpleGraph<V> |
No self-edges, no arc weights.
|
| UnknownTreeNodeException |
The EfficientTree is designed to be extensible.
|
| UpToKSuccessor |
|
| UpToKSuccessorMatrix |
|
| XLifeCycleClassifier |
|
| XLifeCycleClassifier.Transition |
|
| XLifeCycleClassifierIgnore |
Class to ignore life cycle transition altogether, by simply classifying each
event as 'complete'.
|
| XLog2Dfg |
|
| XLog2DfgDialog |
|
| XorDoubleSingleChild |
|
| XorTauTau |
|
| XorTauTauLoop2flowerRevert |
|