public interface ReplayAlgorithm
Modifier and Type | Interface and Description |
---|---|
static class |
ReplayAlgorithm.CloseResult |
static class |
ReplayAlgorithm.Debug
Debug levels for the replayer.
|
Modifier and Type | Method and Description |
---|---|
int |
addNewMarking(byte[] marking)
Adds a new marking to the internal storage.
|
boolean |
equalMarking(int markingId,
byte[] marking)
Check for equality between the stored marking with ID markingId and an
explicit marking.
|
long |
getEstimatedMemorySize()
Estimates the memory size of the internal data structures in bytes.
|
int |
getFScore(int markingId)
Returns the f score (i.e.
|
int |
getGScore(int markingId)
Returns the g score (i.e.
|
int |
getHScore(int marking)
Returns the h score (i.e.
|
int |
getIterationNumber()
Returns the current iteration number of the algorithm if there are multiple
iterations in which the same marking IDs will be present.
|
int |
getLastRankOf(int markingId)
Returns the highest rank of an event explained by the path through which the
stored marking with ID markingId was reached.
|
byte[] |
getMarking(int markingId)
Returns the explicit representation of the marking stored with ID markingId.
|
SyncProduct |
getNet()
Returns the synchronous product for which this ReplayAlgorithm was
instantiated
|
int |
getPathLength(int marking)
returns the length of the path from the initial marking to reach this marking
|
gnu.trove.map.TObjectIntMap<Utils.Statistic> |
getStatistics()
Obtain the statistics after computing an alignment.
|
boolean |
hasExactHeuristic(int markingId)
Checks if the stored marking with ID markingId has an exact value for the
heuristic function g.
|
int |
hashCode(byte[] marking)
Returns the hashCode for a marking represented explicitly as an array of
bytes.
|
int |
hashCode(int markingId)
Returns the hashCode for the stored marking with ID markingId.
|
boolean |
isClosed(int markingId)
Checks if the stored marking with ID markingId is in the closed Set.
|
boolean |
isInfinite(int heur)
Checks if a value for the h-score is INFINITE.
|
void |
putStatistic(Utils.Statistic stat,
int value)
Adds a statistic to the set of statistics.
|
int[] |
run(Canceler canceler,
int timeoutMilliseconds,
int maximumNumberOfStates,
int costUpperLimit)
Run the replay algorithm.
|
SyncProduct getNet()
int getIterationNumber()
gnu.trove.map.TObjectIntMap<Utils.Statistic> getStatistics()
int[] run(Canceler canceler, int timeoutMilliseconds, int maximumNumberOfStates, int costUpperLimit) throws nl.tue.astar.util.ilp.LPMatrixException
canceler
- Allows for canceling the computationtimeoutMilliseconds
- Timeout for the computationmaximumNumberOfStates
- Maximum number of states expandedcostUpperLimit
- Maximum cost of the alignment. Providing an upperbound of 0 will
answer the yes/no question if the trace is fitting (assuming
synchronous and tau-moves have cost 0)nl.tue.astar.util.ilp.LPMatrixException
- Exceptions is thrown if there is a problem with the LP
computations.void putStatistic(Utils.Statistic stat, int value)
stat
- value
- int addNewMarking(byte[] marking)
marking
- the byte[] indicating the number of tokens per placebyte[] getMarking(int markingId)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking())int hashCode(byte[] marking)
marking
- the byte[] indicating the number of tokens per placeboolean equalMarking(int markingId, byte[] marking)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking())marking
- the byte[] indicating the number of tokens per placeint hashCode(int markingId)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking()boolean hasExactHeuristic(int markingId)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking()int getLastRankOf(int markingId)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking()int getFScore(int markingId)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking()int getGScore(int markingId)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking()int getHScore(int marking)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking()boolean isInfinite(int heur)
heur
- a value for the h-scoreboolean isClosed(int markingId)
markingId
- an ID of a previously stored marking (ID obtained through
addNewMarking()long getEstimatedMemorySize()
int getPathLength(int marking)
marking
-