Skip to main content

Finding Uniwired Petri Nets Using eST-Miner

  • Conference paper
  • First Online:
Business Process Management Workshops (BPM 2019)

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 362))

Included in the following conference series:

Abstract

In process discovery, the goal is to find, for a given event log, the model describing the underlying process. While process models can be represented in a variety of ways, in this paper we focus on a subclass of Petri nets. In particular, we describe a new class of Petri nets called Uniwired Petri Nets and first results on their expressiveness. They provide a balance between simple and readable process models on the one hand, and the ability to model complex dependencies on the other hand. We then present an adaptation of our eST-Miner aiming to find such Petri Nets efficiently. Constraining ourselves to uniwired Petri nets allows for a massive decrease in computation time compared to the original algorithm, while still discovering complex control-flow structures such as long-term-dependencies. Finally, we evaluate and illustrate the performance of our approach by various experiments.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Wen, L., van der Aalst, W., Wang, J., Sun, J.: Mining process models with non-free-choice constructs. Data Min. Knowl. Discov. 15(2), 145–180 (2007)

    Article  MathSciNet  Google Scholar 

  2. 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). https://doi.org/10.1007/978-3-642-38697-8_17

    Chapter  Google Scholar 

  3. Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Text in Theoretical Computer Science, an EATCS Series. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47967-4

    Book  MATH  Google Scholar 

  4. Lorenz, R., Mauser, S., Juhás, G.: How to synthesize nets from languages: a survey. In: Proceedings of the 39th Conference on Winter Simulation: 40 Years! The Best is Yet to Come, WSC 2007. IEEE Press (2007)

    Google Scholar 

  5. van der Werf, J.M.E.M., van Dongen, B.F., Hurkens, C.A.J., Serebrenik, A.: Process discovery using integer linear programming. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 368–387. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68746-7_24

    Chapter  Google Scholar 

  6. van Zelst, S.J., van Dongen, B.F., van der Aalst, W.M.P.: Avoiding over-fitting in ILP-based process discovery. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 163–171. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23063-4_10

    Chapter  Google Scholar 

  7. Mannel, L.L., van der Aalst, W.M.P.: Finding complex process-structures by exploiting the token-game. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 258–278. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21571-2_15

    Chapter  Google Scholar 

  8. van der Aalst, W.: Discovering the “glue” connecting activities - exploiting monotonicity to learn places faster. In: It’s All About Coordination - Essays to Celebrate the Lifelong Scientific Achievements of Farhad Arbab (2018)

    Google Scholar 

  9. Aalst, W., Weijters, A., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 16(9), 1128–1142 (2004)

    Article  Google Scholar 

  10. Polato, M.: Dataset belonging to the help desk log of an Italian company (2017)

    Google Scholar 

  11. Steeman, W.: BPI challenge 2013, incidents (2013). https://doi.org/10.4121/UUID:500573E6-ACCC-4B0C-9576-AA5468B10CEE

  12. Mannhardt, F.: Sepsis cases - event log (2016)

    Google Scholar 

  13. De Leoni, M., Mannhardt, F.: Road traffic fine management process (2015)

    Google Scholar 

  14. van der Aalst, W.M.P.: Event logs and models used in Process Mining: Data Science in Action (2016). http://www.processmining.org/event_logs_and_models_used_in_book

Download references

Acknowledgments

We thank the Alexander von Humboldt (AvH) Stiftung for supporting our research.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lisa Luise Mannel .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mannel, L.L., van der Aalst, W.M.P. (2019). Finding Uniwired Petri Nets Using eST-Miner. In: Di Francescomarino, C., Dijkman, R., Zdun, U. (eds) Business Process Management Workshops. BPM 2019. Lecture Notes in Business Information Processing, vol 362. Springer, Cham. https://doi.org/10.1007/978-3-030-37453-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37453-2_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37452-5

  • Online ISBN: 978-3-030-37453-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics