Modifier and Type | Method and Description |
---|---|
static Pair<AttributeClassifiers.AttributeClassifier[],AttributeClassifiers.AttributeClassifier> |
AttributeClassifiers.getAttributeClassifiers(org.deckfour.xes.model.XLog log,
java.lang.String[] attributes,
boolean filterLifeCycleClassifiers) |
static <L,R> Pair<L,R> |
Pair.of(L left,
R right) |
Modifier and Type | Method and Description |
---|---|
static Pair<org.processmining.processtree.ProcessTree,java.util.Map<org.processmining.processtree.conversion.ProcessTree2Petrinet.UnfoldedNode,org.processmining.processtree.conversion.ProcessTree2Petrinet.UnfoldedNode>> |
ExpandProcessTree.expand(org.processmining.processtree.ProcessTree tree)
Expands a collapsed process tree, i.e.
|
Modifier and Type | Method and Description |
---|---|
static Pair<java.util.BitSet,int[]> |
EfficientTreeReduce.isSuperfluousTau(EfficientTree tree,
java.util.BitSet canProduceTau) |
Modifier and Type | Method and Description |
---|---|
Pair<java.lang.Integer,java.lang.Integer> |
ConcurrentOptionalOrLogInfo.findBiImplication() |
Pair<java.lang.Integer,java.lang.Integer> |
ConcurrentOptionalOrLogInfo.findOptionalAnd(java.util.Set<java.util.BitSet> traces)
Find a pair of components A, B such that A implies B and A is optional.
|
Pair<java.lang.Integer,java.lang.Integer> |
ConcurrentOptionalOrLogInfo.findOr(java.util.Set<java.util.BitSet> traces) |
Modifier and Type | Method and Description |
---|---|
protected Pair<java.util.Set<org.deckfour.xes.classification.XEventClass>,java.util.Set<org.deckfour.xes.classification.XEventClass>> |
SATSolveSingle.compute() |