Class ReplayBasedImplicitPlaceFinder
- java.lang.Object
-
- org.processmining.implicitplaceidentification.algorithms.ReplayBasedImplicitPlaceFinder
-
public class ReplayBasedImplicitPlaceFinder extends java.lang.ObjectThis class identifies implicit places in Petri net by replaying an event log on the net and performing a pairwise comparison of the token histories of places. Requirements for the input: - bijective mapping between log events and transitions (no label splitting or silent transitions) - no self loops allowedThis finder is not exclusive to inputs mined with the eST-Miner and also supports arc weights > 1 TODO places empty in beginning and end of replay? TODO Findmode for safe removal
-
-
Constructor Summary
Constructors Constructor Description ReplayBasedImplicitPlaceFinder(org.processmining.models.graphbased.directed.petrinet.Petrinet petrinet, org.processmining.models.semantics.petrinet.Marking initialMarking, org.deckfour.xes.model.XLog eventLog)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.Set<org.processmining.models.graphbased.directed.petrinet.elements.Place>find()Finds implicit places in the Petri net.java.util.Set<org.processmining.models.graphbased.directed.petrinet.elements.Place>getPlacesImplyingP(org.processmining.models.graphbased.directed.petrinet.elements.Place place)Determines the implicitness via a pairwise comparison of marking histories of all places if there exists a p2 s.t.
-
-
-
Method Detail
-
find
public java.util.Set<org.processmining.models.graphbased.directed.petrinet.elements.Place> find()
Finds implicit places in the Petri net.- Returns:
- a set of implicit places in the Petri net
-
getPlacesImplyingP
public java.util.Set<org.processmining.models.graphbased.directed.petrinet.elements.Place> getPlacesImplyingP(org.processmining.models.graphbased.directed.petrinet.elements.Place place)
Determines the implicitness via a pairwise comparison of marking histories of all places if there exists a p2 s.t. markings in p1 > markings in p2, compute p3=p1-p2. If p3 exists in the net, p1 is implicit- Parameters:
place- the place for which is determined whether is it implicit- Returns:
- The set of places that make the given place implicit. If the place is not implicit, the set is empty.
-
-