Decomposed replay using hiding and reduction


Verbeek, H.M.W. (2016). Decomposed replay using hiding and reduction. In L. Cabac, L.M. Kristensen & H. Rölke (Eds.), PNSE 2016 : International Workshop on Petri Nets and Software Engineering. 20-21 June 2016, Torun, Poland (pp. 533-552). (CEUR-WS, No. 1591). s.l.: In Scopus Cited 1 times. Lees meer: Medialink/Full text



In the area of process mining, decomposed replay has been proposed to be able to deal with nets and logs containing many different activities. The main assumption behind this decomposition is that replaying many subnets and sublogs containing only some activities is faster then replaying a single net and log containing many activities. Although for many nets and logs this assumption does hold, there are also nets and logs for which it does not hold. This paper shows an example net and log for which the decomposed replay may take way more time, and provides an explanation why this is the case. Next, to mitigate this problem, this paper proposes an alternative decomposed replay, and shows that this alternative decomposed replay is faster than the monolithic replay even for the problematic cases as identified earlier.owever, the alternative decomposed replay is often slower than the original decomposed approach. An advantage of the alternative decomposed approach over the original approach is that its cost estimates are typically better.