Skip to main content
SpringerLink
Log in
Book cover

International Conference on Business Process Management

BPM 2017: Business Process Management pp 22–39Cite as

Synthesizing Petri Nets from Hasse Diagrams

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10445))

Abstract

Synthesis aims at producing a process model from specified sample executions. A user can specify a set of executions of a system in a specification language that is much simpler than a process modeling language. The intended process model is then constructed automatically.

Synthesis algorithms have been extensively explored for cases where the specification language is a reachability graph or a sequential language. Concerning synthesis from partial languages, however, there is a significant gap between theory and practical application. In the literature, we find two different synthesis methods for partial languages, but both have poor runtime even in reasonably sized practical examples. In this paper, we introduce a new and more efficient synthesis algorithm for partial languages based on Hasse diagrams.

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

References

  1. van der Aalst, W.M.P., Dongen, B.F.: Discovering petri nets from event logs. In: Jensen, K., Aalst, W.M.P., Balbo, G., Koutny, M., Wolf, K. (eds.) Transactions on Petri Nets and Other Models of Concurrency VII. LNCS, vol. 7480, pp. 372–422. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38143-0_10

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  3. van der Aalst, W.M.P.: The application of petri nets to workflow management. J. Circ. Syst. Comput. 8(1), 21–66 (1998)

    Article  Google Scholar 

  4. Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Texts in Theoretical Computer Science. Springer, Heidelberg (2015)

    MATH  Google Scholar 

  5. van Beest, N., Dumas, M., Garca-Bauelos, L., La Rosa, M.: Log delta analysis: interpretable differencing of business process event logs. Eprint no. 83018. Queensland University of Technology (2015)

    Google Scholar 

  6. Bergenthum, R., Lorenz, R.: Verification of scenarios in petri nets using compact tokenflows. Fundam. Informaticae 137, 117–142 (2015). IOS Press

    MathSciNet  MATH  Google Scholar 

  7. Bergenthum, R.: Faster verification of partially ordered runs in petri nets using compact tokenflows. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 330–348. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38697-8_18

    Chapter  MATH  Google Scholar 

  8. Bergenthum, R., Desel, J., Mauser, S.: Comparison of different algorithms to synthesize a petri net from a partial language. In: Jensen, K., Billington, J., Koutny, M. (eds.) Transactions on Petri Nets and Other Models of Concurrency III. LNCS, vol. 5800, pp. 216–243. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04856-2_9

    Chapter  MATH  Google Scholar 

  9. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of petri nets from finite partial languages. Fundam. Informaticae 88, 437–468 (2008). IOS Press

    MathSciNet  MATH  Google Scholar 

  10. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of petri nets from scenarios with viptool. In: Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 388–398. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68746-7_25

    Chapter  MATH  Google Scholar 

  11. 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). doi:10.1007/978-3-540-75183-0_27

    Chapter  Google Scholar 

  12. Carmona, J.: Projection approaches to process mining using region-based techniques. Data Min. Knowl. Discov. 24(1), 218–246 (2012)

    Article  MathSciNet  Google Scholar 

  13. Carmona, J., Cortadella, J., Kishinevsky, M.: New region-based algorithms for deriving bounded petri nets. IEEE Trans. Comput. 59(3), 371–384 (2010)

    Article  MathSciNet  Google Scholar 

  14. Carmona, J., Cortadella, J., Kishinevsky, M.: Genet: a tool for the synthesis and mining of petri nets. Appl. Concurrency Syst. Des. 2009, 181–185 (2009)

    Google Scholar 

  15. Desel, J., Juhás, G., Lorenz, R., Neumair, C.: Modelling and validation with viptool. In: Aalst, W.M.P., Weske, M. (eds.) BPM 2003. LNCS, vol. 2678, pp. 380–389. Springer, Heidelberg (2003). doi:10.1007/3-540-44895-0_26

    Chapter  Google Scholar 

  16. Desel, J., Erwin, T.: Quantitative engineering of business processes with VIPbusiness. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 219–242. Springer, Heidelberg (2003). doi:10.1007/978-3-540-40022-6_11

    Chapter  Google Scholar 

  17. Desel, J., Juhás, G.: “What is a petri net?” Informal answers for the informed reader. In: Ehrig, H., Padberg, J., Juhás, G., Rozenberg, G. (eds.) Unifying Petri Nets. LNCS, vol. 2128, pp. 1–25. Springer, Heidelberg (2001). doi:10.1007/3-540-45541-8_1

    Chapter  MATH  Google Scholar 

  18. Desel, J., Reisig, W.: Place/transition Petri nets. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 122–173. Springer, Heidelberg (1998). doi:10.1007/3-540-65306-6_15

    Chapter  MATH  Google Scholar 

  19. van Dongen, B.F., Medeiros, A.K.A., Verbeek, H.M.W., Weijters, A.J.M.M., Aalst, W.M.P.: The ProM framework: a new era in process mining tool support. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 444–454. Springer, Heidelberg (2005). doi:10.1007/11494744_25

    Chapter  Google Scholar 

  20. Dumas, M., García-Bañuelos, L.: Process mining reloaded: event structures as a unified representation of process models and event logs. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 33–48. Springer, Cham (2015). doi:10.1007/978-3-319-19488-2_2

    Chapter  MATH  Google Scholar 

  21. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures. part i: basic notions and the representation problem, part ii: state spaces of concurrent systems. Acta Inf. 27(4), 315–368 (1990)

    Article  Google Scholar 

  22. Fahland, D.: Scenario-based process modeling with Greta. In: BPM Demonstration Track 2010, vol. 615. CEUR (2010)

    Google Scholar 

  23. Fahland, D.: Oclets – scenario-based modeling with Petri nets. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 223–242. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02424-5_14

    Chapter  MATH  Google Scholar 

  24. Grabowski, J.: On partial languages. Fundam. Informaticae 4, 427–498 (1981). IOS Press

    MathSciNet  MATH  Google Scholar 

  25. Goltz, U., Reisig, W.: Processes of place/transition-nets. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 264–277. Springer, Heidelberg (1983). doi:10.1007/BFb0036914

    Chapter  Google Scholar 

  26. Juhás, G., Lorenz, R., Desel, J.: Can I execute my scenario in your net? In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 289–308. Springer, Heidelberg (2005). doi:10.1007/11494744_17

    Chapter  Google Scholar 

  27. Lorenz, R., Juhás, G., Bergenthum, R., Desel, J., Mauser, S.: Executability of scenarios in Petri nets. Theoret. Comput. Sci. 410(12–13), 1190–1216 (2009). Elsevier

    Article  MathSciNet  Google Scholar 

  28. Mayr, H.C., Kop, C., Esberger, D.: Business process modeling and requirements modeling. In: ICDS 2007, pp. 8–14. IEEE Computer Society (2007)

    Google Scholar 

  29. Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs (1981)

    MATH  Google Scholar 

  30. Reisig, W.: Understanding Petri Nets - Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013)

    Book  Google Scholar 

  31. Solé, M., Carmona, J.: Region-based foldings in process discovery. IEEE Trans. Knowl. Data Eng. 25(1), 192–205 (2013)

    Article  Google Scholar 

  32. van Zelst, S.J., van Dongen, B.F., van der Aalst, W.M.P.: ILP-based process discovery using hybrid regions. In: ATAED 2015, vol. 1371, pp. 47–61. CEUR (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FernUniversität in Hagen, Hagen, Germany

    Robin Bergenthum

Authors
  1. Robin Bergenthum
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robin Bergenthum .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Universitat Politècnica de Catalunya, Barcelona, Spain

    Josep Carmona

  2. Department of Computer Science, University of Paderborn, Paderborn, Germany

    Gregor Engels

  3. Department of Supply Chain and Information Systems, Pennsylvania State University, University Park, Pennsylvania, USA

    Akhil Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bergenthum, R. (2017). Synthesizing Petri Nets from Hasse Diagrams. In: Carmona, J., Engels, G., Kumar, A. (eds) Business Process Management. BPM 2017. Lecture Notes in Computer Science(), vol 10445. Springer, Cham. https://doi.org/10.1007/978-3-319-65000-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-65000-5_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64999-3

  • Online ISBN: 978-3-319-65000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation