Skip to main content
SpringerLink
Log in
Book cover

Transactions on Petri Nets and Other Models of Concurrency V pp 221–242Cite as

Incremental Process Discovery

  • Chapter

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

Abstract

Process Discovery techniques provide an automatic shift between a trace or automata model into an event-based one. In particular, the problem of deriving Petri nets from transition systems or languages has many applications, ranging from CAD for VLSI to medical applications, among others. The most popular algorithms to accomplish this task are based on the theory of regions. However, one of the problems of such algorithms is the space requirements: for real-life or industrial instances, some of the region-based algorithms cannot handle in memory the internal representation of the input or the exploration lattice required. In this paper, the incremental derivation of a basis of regions and the later partitioned basis exploration are presented, which allow splitting large inputs in fragments of tractable size. The theory of the paper has been implemented as the new tool dbminer. Experimental results on medium-sized benchmarks show promising reductions in the time required for process discovery when compared to other region-based approaches.

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

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van der Aalst, W.M.P.: Process Mining. Springer, Heidelberg (2011)

    Book  MATH  Google Scholar 

  2. Murata, T.: Petri Nets: Properties, analysis and applications. Proceedings of the IEEE, 541–580 (April 1989)

    Google Scholar 

  3. van der Aalst, W.M.P., Weijters, T., Maruster, L.: Workflow mining: Discovering process models from event logs. IEEE TKDE 16(9), 1128–1142 (2004)

    Google Scholar 

  4. van der Aalst, W.M.P., de Medeiros, A.K.A., Weijters, A.J.M.M.T.: Genetic Process Mining. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 48–69. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures. Part I, II. Acta Informatica 27, 315–368 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dongen, B.F.V., Busi, N., Pinna, G.M., van der Aalst, W.: An iterative algorithm for applying the theory of regions in process mining. In: FABPWS, pp. 36–55 (2007)

    Google Scholar 

  7. Carmona, J., Cortadella, J., Kishinevsky, M.: New region-based algorithms for deriving bounded Petri nets. IEEE Transactions on Computers 59(3) (2009)

    Google Scholar 

  8. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Process Mining Based on Regions of Languages. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 375–383. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Carmona, J., Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: A Symbolic Algorithm for the Synthesis of Bounded Petri Nets. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 92–111. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Badouel, E., Bernardinello, L., Darondeau, P.: Polynomial Algorithms for the Synthesis of Bounded Nets. In: Mosses, P.D., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915, pp. 364–383. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  11. Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general Petri nets. Theor. Comput. Sci. 153(1&2), 129–170 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Inf. 33(4), 297–315 (1996)

    Article  MathSciNet  Google Scholar 

  13. Badouel, E., Darondeau, P.: Theory of Regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Mukund, M.: Petri nets and step transition systems. Int. Journal of Foundations of Computer Science 3(4), 443–478 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Darondeau, P.: Deriving Unbounded Petri Nets from Formal Languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 533–548. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  16. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri nets from finite partial languages. Fundam. Inform. 88(4), 437–468 (2008)

    MathSciNet  MATH  Google Scholar 

  17. Caillaud, B.: Synet : A synthesizer of distributable bounded Petri-nets from finite automata (2002), http://www.irisa.fr/s4/tools/synet/

  18. Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri nets from finite transition systems. IEEE Trans. on Computers 47(8), 859–882 (1998)

    Article  MathSciNet  Google Scholar 

  19. Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computer-Aided Design 35(8), 677–691 (1986)

    MATH  Google Scholar 

  20. Solé, M., Carmona, J.: Process Mining from a Basis of State Regions. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 226–245. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  21. van der Aalst, W., Rubin, V., Verbeek, H., van Dongen, B., Kindler, E., Günther, C.: Process mining: a two-step approach to balance between underfitting and overfitting. Software and Systems Modeling 9, 87–111 (2010)

    Article  Google Scholar 

  22. Bernardinello, L., Michelis, G.D., Petruni, K., Vigna, S.: On the synchronic structure of transition systems. In: Structures in Concurrency Theory, 69–84 (1995)

    Google Scholar 

  23. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)

    MATH  Google Scholar 

  24. Solé, M.: dbminer, http://personals.ac.upc.edu/msole/homepage/dbminer.html

  25. 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)

    Chapter  Google Scholar 

  26. Solé, M., Carmona, J.: Rbminer: A Tool for Discovering Petri Nets from Transition Systems. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 396–402. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  27. van der Aalst, W.M.P., van Dongen, B.F., Günther, C.W., Mans, R.S., de Medeiros, A.K.A., Rozinat, A., Rubin, V., Song, M., Verbeek, H.M.W(E.), Weijters, A.J.M.M.T.: ProM 4.0: Comprehensive Support for real Process Analysis. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 484–494. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  28. Eindhoven University of Technology: Process mining wiki, http://www.processmining.org

  29. Muñoz-Gama, J., Carmona, J.: A Fresh Look at Precision in Process Conformance. In: Hull, R., Mendling, J., Tai, S. (eds.) BPM 2010. LNCS, vol. 6336, pp. 211–226. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Architecture Department, UPC, Spain

    Marc Solé

  2. Software Department, UPC, Spain

    Marc Solé & Josep Carmona

Authors
  1. Marc Solé
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josep Carmona
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science, Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, 8200, Aarhus N, Denmark

    Kurt Jensen

  2. Computer Science Department, University of Turin, Corso Svizzera 185, 10149, Turin, Italy

    Susanna Donatelli

  3. LIACS, Leiden University, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    Jetty Kleijn

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Solé, M., Carmona, J. (2012). Incremental Process Discovery. In: Jensen, K., Donatelli, S., Kleijn, J. (eds) Transactions on Petri Nets and Other Models of Concurrency V. Lecture Notes in Computer Science, vol 6900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29072-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29072-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29071-8

  • Online ISBN: 978-3-642-29072-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation