Skip to main content

Inferring the Repetitive Behaviour from Event Logs for Process Mining Discovery

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10089))

Abstract

This paper addresses the problem of discovering a sound Workflow net (WFN) from event traces representing the behavior of a discrete event process. A novel and efficient method for inferring the repetitive behaviour in a workflow log is proposed. It is based on an iterative search and filtering of cycles computed in each trace; a graph of causal relations is built for each cycle, which helps to find the supports of the t-invariants of an extended WFN. The t-invariants are used for determining causal and concurrent relations between events, allowing building the WFN efficiently in a complete discovery technique.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Van der Aalst, W., 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 

  2. van der Aalst, W.M.P.: Process Mining: Discovery Conformance and Enhancement of Business Processes, 1st edn. Springer, Heidelberg (2011)

    Book  MATH  Google Scholar 

  3. Agrawal, R., Gunopulos, D., Leymann, F.: Mining process models from workflow logs. In: Schek, H.-J., Alonso, G., Saltor, F., Ramos, I. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 467–483. Springer, Heidelberg (1998). doi:10.1007/BFb0101003. http://dblp.uni-trier.de/rec/bibtex/conf/edbt/AgrawalGL98

    Chapter  Google Scholar 

  4. Angluin, D.: Queries and Concept Learning. Mach. Learn. 2(4), 319–342 (1988). http://dx.doi.org/10.1023/a:1022821128753

    MathSciNet  Google Scholar 

  5. Cabasino, M.P., Darondeau, P., Fanti, M.P., Seatzu, C.: Model identification and synthesis of discrete-event systems. In: Zhou, M., Li, H.-X., Weijnen, M. (eds.) Contemporary Issues in Systems Science and Engineering. John Wiley & Sons Inc, Hoboken (2015). doi:10.1002/9781119036821.ch10

    Google Scholar 

  6. Cabasino, M.P., Giua, A., Seatzu, C.: Linear programming techniques for the identification of place/transition nets. In: 47th IEEE Conference on Decision and Control, CDC 2008, pp. 514–520. IEEE (2008)

    Google Scholar 

  7. Cook, J.E., Du, Z., Liu, C., Wolf, A.L.: Discovering models of behavior for concurrent workflows. Comput. Ind. 53(3), 297–319 (2004)

    Article  Google Scholar 

  8. Dotoli, M., Pia Fanti, M., Mangini, A.M., Ukovich, W.: Identification of the unobservable behaviour of industrial automation systems by petri nets. Control Eng. Pract. 19(9), 958–966 (2011)

    Article  Google Scholar 

  9. Estrada-Vargas, A.P., Lesage, J.J., López-Mellado, E.: A stepwise method for identification of controlled discrete manufacturing systems. Int. J. Comput. Integr. Manufact. 28(2), 187–199 (2015)

    Article  Google Scholar 

  10. Estrada-Vargas, A.P., López-Mellado, E., Lesage, J.J.: A comparative analysis of recent identification approaches for discrete-event systems. Math. Probl. Eng. 2010, 21 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Giua, A., Seatzu, C.: Identification of free-labeled petri nets via integer programming. In: 44th IEEE Conference on Decision and Control, 2005 and 2005 European Control Conference, CDC-ECC 2005, pp. 7639–7644. IEEE (2005)

    Google Scholar 

  12. Gold, M.E.: Language identification in the limit. Inf. Control 10(5), 447–474 (1967). http://www.isrl.uiuc.edu/~amag/langev/paper/gold67limit.html

    Article  MathSciNet  MATH  Google Scholar 

  13. Klein, S., Litz, L., Lesage, J.J., et al.: Fault detection of discrete event systems using an identification approach. In: 16th IFAC world Congress (2005)

    Google Scholar 

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

  15. Meda-Campana, M., Ramirez-Treviro, A., López-Mellado, E.: Asymptotic identification of discrete event systems. In: Proceedings of the 39th IEEE Conference on Decision and Control, vol. 3, pp. 2266–2271. IEEE (2000)

    Google Scholar 

  16. Meda-Campana, M., López-Mellado, E.: Identification of concurrent discrete event systems using petri nets. In: Proceedings of the 17th IMACS World Congress on Computational and Applied Mathematics, pp. 11–15 (2005)

    Google Scholar 

  17. Roth, M., Schneider, S., Lesage, J.J., Litz, L.: Fault detection and isolation in manufacturing systems with an identified discrete event model. Int. J. Syst. Sci. 43(10), 1826–1841 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Tapia-Flores, T., López-Mellado, E., Estrada-Vargas, A.P., Lesage, J.J.: Petri net discovery of discrete event processes by computing t-invariants. In: Emerging Technology and Factory Automation (ETFA), pp. 1–8. IEEE, September 2014

    Google Scholar 

  19. Tapia-Flores, T., Rodríguez-Pérez, E., López-Mellado, E.: Discovering process models from incomplete event logs using conjoint occurrence classes. In: van der Aalst, W.M.P., Bergenthum, R., Carmona, J. (eds.) Algorithms & Theories for the Analysis of Event Data, vol. 1592, pp. 31–46. CEUR-WS.org, New York (2016). http://ceur-ws.org/Vol-1592/paper03.pdf

    Google Scholar 

  20. Wang, D., Ge, J., Hu, H., Luo, B.: A new process mining algorithm based on event type. In: 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing (DASC), pp. 1144–1151. IEEE (2011)

    Google Scholar 

  21. Wang, D., Ge, J., Hu, H., Luo, B., Huang, L.: Discovering process models from event multiset. Expert Syst. Appl. 39(15), 11970–11978 (2012)

    Article  Google Scholar 

  22. Wen, L., van der Aalst, W.M.P., Wang, J., Sun, J.: Mining process models with non-free-choice constructs. Data Min. Knowl. Discov. 15(2), 145–180 (2007). http://dx.doi.org/10.1007/s10618-007-0065-y

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tonatiuh Tapia-Flores .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Tapia-Flores, T., López-Mellado, E. (2017). Inferring the Repetitive Behaviour from Event Logs for Process Mining Discovery. In: Prasath, R., Gelbukh, A. (eds) Mining Intelligence and Knowledge Exploration. MIKE 2016. Lecture Notes in Computer Science(), vol 10089. Springer, Cham. https://doi.org/10.1007/978-3-319-58130-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-58130-9_16

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-58130-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics