Skip to main content
Springer Nature Link
Log in

Decomposed Replay Using Hiding and Reduction as Abstraction

  • Chapter
  • First Online:
Transactions on Petri Nets and Other Models of Concurrency XII

Part of the book series: Lecture Notes in Computer Science ((TOPNOC,volume 10470))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 12.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    A complicating factor here is that the current implementation of the monolithic replayer takes costs with an integer value. As a result, we cannot evenly split the costs 5 of a model move over two subnets. Therefore, we initially set out with costs 10 and 4. Later on, we implemented a more elaborate scheme to have the decomposed replayer support a costs divided by any number of subnets.

References

  1. van der Aalst, W.M.P.: Process Mining: Discovery, Conformance and Enhancement of Business Processes, 1st edn. Springer, Heidelberg (2011). doi:10.1007/978-3-642-19345-3

    Book  MATH  Google Scholar 

  2. van der Aalst, W.M.P.: Decomposing Petri nets for process mining: a generic approach. Distrib. Parallel Dat. 31(4), 471–507 (2013)

    Article  Google Scholar 

  3. van der Aalst, W.M.P., Adriansyah, A., van Dongen, B.F.: Replaying history on process models for conformance checking and performance analysis. Data Min. Knowl. Disc. 2(2), 182–192 (2012)

    Article  Google Scholar 

  4. van Dongen, B.F.: BPI challenge 2012 data set (2012). doi:10.4121/uuid:3926db30-f712-4394-aebc-75976070e91f

  5. van Dongen, B.F.: BPI challenge 2015 data set (2015). doi:10.4121/uuid:31a308ef-c844-48da-948c-305d167a0ec1

  6. Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from event logs - a constructive approach. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 311–329. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38697-8_17

    Chapter  Google Scholar 

  7. Maruster, L., Weijters, A.J.M.M., van der Aalst, W.M.P., van der Bosch, A.: A rule-based approach for process discovery: dealing with noise and imbalance in process logs. Data Min. Knowl. Disc. 13(1), 67–87 (2006)

    Article  MathSciNet  Google Scholar 

  8. Munoz-Gama, J., Carmona, J., van der Aalst, W.M.P.: Conformance checking in the large: partitioning and topology. In: Daniel, F., Wang, J., Weber, B. (eds.) BPM 2013. LNCS, vol. 8094, pp. 130–145. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40176-3_11

    Chapter  Google Scholar 

  9. Munoz-Gama, J., Carmona, J., van der Aalst, W.M.P.: Single-entry single-exit decomposed conformance checking. Inf. Syst. 46, 102–122 (2014)

    Article  Google Scholar 

  10. Murata, T.: Petri nets: properties, analysis and applications. P. IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands

    H. M. W. Verbeek

Authors
  1. H. M. W. Verbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. M. W. Verbeek .

Editor information

Editors and Affiliations

  1. Newcastle University, Newcastle upon Tyne, United Kingdom

    Maciej Koutny

  2. LIACS, Leiden University, Leiden, The Netherlands

    Jetty Kleijn

  3. Polish Academy of Sciences, Institute of Computer Science, Warsaw, Poland

    Wojciech Penczek

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag GmbH Germany

About this chapter

Cite this chapter

Verbeek, H.M.W. (2017). Decomposed Replay Using Hiding and Reduction as Abstraction. In: Koutny, M., Kleijn, J., Penczek, W. (eds) Transactions on Petri Nets and Other Models of Concurrency XII. Lecture Notes in Computer Science(), vol 10470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55862-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-55862-1_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-55861-4

  • Online ISBN: 978-3-662-55862-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics