Decomposed replay using hiding and reduction as abstraction

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    7 Citations (Scopus)

    Abstract

    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 way to abstract the subnets from the single net, and shows that the decomposed replay using this alternative abstraction is faster than the monolithic replay even for the problematic cases as identified earlier. However, the alternative abstraction often results in longer computation times for the decomposed replay than the original abstraction. An advantage of the alternative abstraction over the original abstraction is that its cost estimates are typically better.

    Original languageEnglish
    Title of host publicationTransactions on Petri Nets and Other Models of Concurrency XII
    EditorsM. Koutny, J. Kleijn, W. Penchek
    Place of PublicationDordrecht
    PublisherSpringer
    Pages166-186
    Number of pages21
    ISBN (Electronic)978-3-662-55862-1
    ISBN (Print)978-3-662-55861-4
    DOIs
    Publication statusPublished - 2017
    Event37th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2016 - Torun, Poland
    Duration: 19 Jun 201624 Jun 2016

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume10470 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference37th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2016
    CountryPoland
    CityTorun
    Period19/06/1624/06/16

    Fingerprint

    Dive into the research topics of 'Decomposed replay using hiding and reduction as abstraction'. Together they form a unique fingerprint.

    Cite this