Advertisement

Constructing Regular Expressions from Real-Life Event Logs

  • Polina D. Tarantsova
  • Anna A. KalenkovaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11179)

Abstract

Process mining is a new discipline aimed at constructing process models from event logs. Recently several methods for the discovery of transition systems from event logs were introduced. Considering these transition systems as finite state machines classical algorithms for deriving regular expressions can be applied. Regular expressions allow representing sequential process models in a hierarchical way, using sequence, choice, and iterative patterns. The aim of this work is to apply and tune an algorithm deriving regular expressions from transition systems within the process mining domain.

Notes

Acknowledgment

This work was supported by the Basic Research Program at the National Research University Higher School of Economics and funded by the President Grant MK-4188.2018.9.

References

  1. 1.
    van der Aalst, W.: Process Mining: Data Science in Action, 2nd edn. Springer, Heidelberg (2016).  https://doi.org/10.1007/978-3-662-49851-4CrossRefGoogle Scholar
  2. 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_17CrossRefGoogle Scholar
  3. 3.
    Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from incomplete event logs. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 91–110. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-07734-5_6CrossRefGoogle Scholar
  4. 4.
    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. Softw. Syst. Model. 9(1), 87 (2008)CrossRefGoogle Scholar
  5. 5.
    Kleene, S.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)Google Scholar
  6. 6.
    Brzozowski, J.: Derivatives of regular expressions. J. ACM 11(4), 481–494 (1964)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Linz, P.: An Introduction to Formal Language and Automata. Jones and Bartlett Publishers Inc., Burlington (2006)zbMATHGoogle Scholar
  8. 8.
    Delgado, M., Morais, J.: Approximation to the smallest regular expression for a given regular language. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 312–314. Springer, Heidelberg (2005).  https://doi.org/10.1007/978-3-540-30500-2_31CrossRefGoogle Scholar
  9. 9.
    van Dongen, B.F., de Medeiros, A.K.A., Verbeek, H.M.W., Weijters, A.J.M.M., van der 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).  https://doi.org/10.1007/11494744_25CrossRefGoogle Scholar
  10. 10.
    Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Symbolic computation of differential equivalences. SIGPLAN Not. 51(1), 137–150 (2016)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.National Research University Higher School of EconomicsMoscowRussia

Personalised recommendations