Package | Description |
---|---|
org.processmining.antialignments.bruteforce | |
org.processmining.antialignments.ilp |
Modifier and Type | Class and Description |
---|---|
class |
Generation<S extends State>
A generation is a collection of states, such that: - For a state s, there is
no state s' in the collection with s.isGreaterOrEqual(s') true.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractState |
class |
EditDistanceState |
class |
HammingState
A state is a pair of a marking and a row in the edit-distance matrix.
|
Modifier and Type | Method and Description |
---|---|
<S extends State> |
State.getNextState(org.processmining.models.semantics.petrinet.Marking newMarking,
short[][] log,
int traceToIgnore,
short executedLabel,
org.processmining.models.graphbased.directed.petrinet.elements.Transition executedTransition) |
Modifier and Type | Method and Description |
---|---|
boolean |
EditDistanceState.hasSameMarkingAs(State s) |
boolean |
HammingState.hasSameMarkingAs(State s) |
boolean |
State.hasSameMarkingAs(State s)
Checks if the marking equals the marking of State s
|
boolean |
EditDistanceState.isGreaterOrEqual(State s) |
boolean |
HammingState.isGreaterOrEqual(State s) |
boolean |
State.isGreaterOrEqual(State s)
returns true if and only if for all elements of the edit distance vector,
the value of this is greater or equal to the value of s.
|
Modifier and Type | Class and Description |
---|---|
class |
SearchQueue<S extends State>
This class implements the search queue for an anti alignment.
|
Modifier and Type | Method and Description |
---|---|
protected <S extends State> |
AntiAlignmentCalculator.update(SearchQueue<S> current,
short[][] log,
int traceToIgnore,
int maxLength) |