Modifier and Type | Method and Description |
---|---|
protected PHead |
AbstractPetrinetReplayer.constructHead(D delegate,
org.processmining.models.semantics.petrinet.Marking m,
org.deckfour.xes.model.XTrace xtrace) |
Modifier and Type | Method and Description |
---|---|
protected int |
AbstractPetrinetReplayer.getMinBoundMoveModel(nl.tue.astar.AStarThread.Canceller canceller,
int delta,
nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,T> aStar,
D delegateD)
get cost if an empty trace is replayed on a model
|
protected double |
PrefixBasedPetrinetReplayer.getMinBoundMoveModel(org.processmining.framework.plugin.PluginContext context,
org.processmining.models.graphbased.directed.petrinet.PetrinetGraph net,
TransEvClassMapping mapping,
org.deckfour.xes.classification.XEventClasses classes,
double delta,
int threads,
nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar) |
Modifier and Type | Class and Description |
---|---|
class |
PHeadUnique |
Modifier and Type | Method and Description |
---|---|
protected PHead |
PHead.createHead(nl.tue.astar.util.ShortShortMultiset marking,
nl.tue.astar.util.ShortShortMultiset parikh,
int hashCode) |
protected PHead |
PHeadUnique.createHead(nl.tue.astar.util.ShortShortMultiset marking,
nl.tue.astar.util.ShortShortMultiset parikh,
int hashCode) |
PHead |
PHead.getNextHead(nl.tue.astar.Record rec,
nl.tue.astar.Delegate<? extends nl.tue.astar.Head,? extends nl.tue.astar.Tail> d,
int modelMove,
int logMove,
int activity) |
PHead |
PHeadCompressor.inflate(java.io.InputStream stream) |
PHead |
PHeadUniqueDijkstraCompressor.inflate(java.io.InputStream stream) |
PHead |
PHeadUniqueILPCompressor.inflate(java.io.InputStream stream) |
Modifier and Type | Method and Description |
---|---|
nl.tue.storage.EqualOperation<nl.tue.astar.impl.State<PHead,T>> |
AbstractPDelegate.getHeadBasedEqualOperation() |
nl.tue.storage.HashOperation<nl.tue.astar.impl.State<PHead,T>> |
AbstractPDelegate.getHeadBasedHashOperation() |
Modifier and Type | Method and Description |
---|---|
nl.tue.astar.Record |
AbstractPDelegate.createInitialRecord(PHead head,
nl.tue.astar.Trace trace) |
nl.tue.astar.impl.DijkstraTail |
PDelegate.createInitialTail(PHead head) |
PILPTail |
PILPDelegate.createInitialTail(PHead head)
Loads the required jar and dll files (from the location) provided by the
user via the settings if not loaded already and creates a solverfactory
|
PNaiveTail |
PNaiveDelegate.createInitialTail(PHead head) |
void |
PHeadCompressor.deflate(PHead object,
java.io.OutputStream stream) |
void |
PHeadCompressor.skip(PHead head,
nl.tue.storage.impl.SkippableOutputStream out) |
Modifier and Type | Method and Description |
---|---|
boolean |
PHeadCompressor.equals(nl.tue.astar.impl.State<PHead,T> object,
nl.tue.storage.CompressedStore<nl.tue.astar.impl.State<PHead,T>> store,
long l) |
boolean |
PHeadCompressor.equals(nl.tue.astar.impl.State<PHead,T> object,
nl.tue.storage.CompressedStore<nl.tue.astar.impl.State<PHead,T>> store,
long l) |
int |
PHeadCompressor.getHashCode(nl.tue.storage.CompressedStore<nl.tue.astar.impl.State<PHead,T>> store,
long l) |
int |
PHeadCompressor.getHashCode(nl.tue.astar.impl.State<PHead,T> object) |
void |
PDelegate.setStateSpace(nl.tue.storage.CompressedHashSet<nl.tue.astar.impl.State<PHead,nl.tue.astar.impl.DijkstraTail>> statespace) |
void |
PNaiveDelegate.setStateSpace(nl.tue.storage.CompressedHashSet<nl.tue.astar.impl.State<PHead,PNaiveTail>> statespace) |
void |
AbstractPILPDelegate.setStateSpace(nl.tue.storage.CompressedHashSet<nl.tue.astar.impl.State<PHead,T>> statespace) |
Constructor and Description |
---|
PILPTail(PILPDelegate delegate,
PHead h,
int minCost) |
Modifier and Type | Method and Description |
---|---|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllKnotSamplingOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Method to be overriden if the thread needs to be changed.
|
protected AllSamplingOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphSamplingAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllPrefixOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Override this method to change the thread used to compute prefix optimal
alignments
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllPrefixOptAlignmentsGraphGuessMarkingAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates) |
protected AllOptAlignmentsGraphThread<PHead,PILPTail> |
AllOptAlignmentsGraphILPAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,PILPTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Override this method to change the thread used to compute optimal
alignments
|
Modifier and Type | Method and Description |
---|---|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllKnotSamplingOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Method to be overriden if the thread needs to be changed.
|
protected AllSamplingOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphSamplingAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllPrefixOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Override this method to change the thread used to compute prefix optimal
alignments
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllPrefixOptAlignmentsGraphGuessMarkingAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates) |
protected AllOptAlignmentsGraphThread<PHead,PILPTail> |
AllOptAlignmentsGraphILPAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,PILPTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Override this method to change the thread used to compute optimal
alignments
|
Modifier and Type | Method and Description |
---|---|
protected int |
NBestAlignmentsTreeAlg.getMinBoundMoveModel(nl.tue.astar.AStarThread.Canceller canceller,
org.deckfour.xes.model.XLog log,
org.processmining.models.graphbased.directed.petrinet.PetrinetGraph net,
TransEvClassMapping mapping,
org.deckfour.xes.classification.XEventClasses classes,
int delta,
int threads,
nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,PNaiveTail> aStar)
get cost if an empty trace is replayed on a model
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllKnotSamplingOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Method to be overriden if the thread needs to be changed.
|
protected AllSamplingOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllOptAlignmentsGraphSamplingAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllPrefixOptAlignmentsGraphAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Override this method to change the thread used to compute prefix optimal
alignments
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
AllPrefixOptAlignmentsGraphGuessMarkingAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates) |
protected AllOptAlignmentsGraphThread<PHead,PILPTail> |
AllOptAlignmentsGraphILPAlg.getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,PILPTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Override this method to change the thread used to compute optimal
alignments
|
protected boolean |
BestWithFitnessBoundAlignmentsTreeAlg.shouldConsiderResult(AllOptAlignmentsTreeAlg.MatchInstancesRes result,
AllOptAlignmentsTreeThread<PHead,nl.tue.astar.impl.DijkstraTail> thread,
PRecord record,
int counter,
org.deckfour.xes.model.XLog log,
int minCostMoveModel) |
protected boolean |
BestWithFitnessBoundPerTraceAlignmentTreeAlg.shouldConsiderResult(AllOptAlignmentsTreeAlg.MatchInstancesRes result,
AllOptAlignmentsTreeThread<PHead,nl.tue.astar.impl.DijkstraTail> thread,
PRecord record,
int counter,
org.deckfour.xes.model.XLog log,
int minCostMoveModel) |
protected boolean |
NBestAlignmentsTreeAlg.shouldConsiderResult(AllOptAlignmentsTreeAlg.MatchInstancesRes result,
AllOptAlignmentsTreeThread<PHead,nl.tue.astar.impl.DijkstraTail> thread,
PRecord record,
int counter,
org.deckfour.xes.model.XLog log,
int minCostMoveModel) |