Using Discriminative Rule Mining to Discover Declarative Process Models with Non-atomic Activities

  • Mario Luca Bernardi
  • Marta Cimitile
  • Chiara Di Francescomarino
  • Fabrizio Maria Maggi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8620)


Process discovery techniques try to generate process models from execution logs. Declarative process modeling languages are more suitable than procedural notations for representing the discovery results deriving from logs of processes working in dynamic and low-predictable environments. However, existing declarative discovery approaches aim at mining declarative specifications considering each activity in a business process as an atomic/instantaneous event. In spite of this, often, in realistic environments, process activities are not instantaneous; rather, their execution spans across a time interval and is characterized by a sequence of states of a transactional lifecycle. In this paper, we investigate how to use discriminative rule mining in the discovery task, to characterize lifecycles that determine constraint violations and lifecycles that ensure constraint fulfillments. The approach has been implemented as a plug-in of the process mining tool ProM and validated on synthetic logs and on a real-life log recorded by an incident and problem management system called VINST in use at Volvo IT Belgium.


Process Discovery Rule Mining Discriminative Mining Non-Atomic Activities Activity lifecycle Linear Temporal Logic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Van der Aalst, W., Pesic, M., Schonenberg, H.: Declarative Workflows: Balancing Between Flexibility and Support. Computer Science - R&D, 99–113 (2009)Google Scholar
  2. 2.
    Bernardi, M.L., Cimitile, M., Lucca, G.A.D., Maggi, F.M.: Using declarative workflow languages to develop process-centric web applications. In: 16th IEEE International Enterprise Distributed Object Computing Conference Workshops, EDOC Workshops, Beijing, China, September 10-14, pp. 56–65 (2012)Google Scholar
  3. 3.
    Bose, R.P.J.C., Maggi, F.M., van der Aalst, W.M.P.: Enhancing declare maps based on event correlations. In: Daniel, F., Wang, J., Weber, B. (eds.) BPM 2013. LNCS, vol. 8094, pp. 97–112. Springer, Heidelberg (2013), Scholar
  4. 4.
    Bose, R.J.C.: Process Mining in the Large: Preprocessing, Discovery, and Diagnostics. Ph.D. thesis, Eindhoven University of Technology (2012)Google Scholar
  5. 5.
    Burattin, A., Maggi, F., van der Aalst, W., Sperduti, A.: Techniques for a Posteriori Analysis of Declarative Processes. In: EDOC, pp. 41–50 (2012)Google Scholar
  6. 6.
    Burattin, A., Sperduti, A.: Heuristics Miner for Time Intervals. In: European Symposium on Artificial Neural Networks (ESANN), Bruges, Belgium (2010)Google Scholar
  7. 7.
    Caruana, R., Niculescu-Mizil, A.: An empirical comparison of supervised learning algorithms. In: Proceedings of the 23rd International Conference on Machine Learning, ICML 2006, pp. 161–168. ACM, New York (2006),
  8. 8.
    Cheng, H., Yan, X., Han, J., Yu, P.S.: Direct discriminative pattern mining for effective classification. In: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 169–178. IEEE Computer Society, Washington, DC (2008), Scholar
  9. 9.
    Chesani, F., Lamma, E., Mello, P., Montali, M., Riguzzi, F., Storari, S.: Exploiting inductive logic programming techniques for declarative process mining. Transactions on Petri Nets and Other Models of Concurrency II, Special Issue on Concurrency in Process-Aware Information Systems 2, 278–295 (2009)CrossRefGoogle Scholar
  10. 10.
  11. 11.
    Kupferman, O., Vardi, M.: Vacuity Detection in Temporal Model Checking. Int. Journal on Software Tools for Technology Transfer, 224–233 (2003)Google Scholar
  12. 12.
    Lo, D., Cheng, H.: Lucia: Mining closed discriminative dyadic sequential patterns. In: Proc. of the International Conference on Extending Database Technology (EDBT), pp. 21–32. Springer (2011)Google Scholar
  13. 13.
    Maggi, F.M., Bose, R.P.J.C., van der Aalst, W.M.P.: Efficient discovery of understandable declarative models from event logs. In: Ralyté, J., Franch, X., Brinkkemper, S., Wrycza, S. (eds.) CAiSE 2012. LNCS, vol. 7328, pp. 270–285. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  14. 14.
    Montali, M., Pesic, M., van der Aalst, W.M.P., Chesani, F., Mello, P., Storari, S.: Declarative Specification and Verification of Service Choreographies. ACM Transactions on the Web 4(1) (2010)Google Scholar
  15. 15.
    Pesic, M., Schonenberg, M.H., van der Aalst, W.M.P.: Declare: Full support for loosely-structured processes. In: EDOC, pp. 287–300 (2007)Google Scholar
  16. 16.
    Quinlan, J.R.: C4.5: Programs for Machine Learning. M. Kaufmann Publishers Inc. (1993)Google Scholar
  17. 17.
    Steeman, W.: Bpi challenge 2013, incidents (2013),
  18. 18.
    Sun, C., Du, J., Chen, N., Khoo, S.C., Yang, Y.: Mining explicit rules for software process evaluation. In: Proceedings of the 2013 International Conference on Software and System Process, ICSSP 2013, pp. 118–125. ACM, New York (2013), Scholar
  19. 19.
    Verbeek, E.H.M.W., Buijs, J., van Dongen, B., van der Aalst, W.M.P.: ProM 6: The Process Mining Toolkit. In: BPM 2010 Demo, pp. 34–39 (2010)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Mario Luca Bernardi
    • 1
  • Marta Cimitile
    • 2
  • Chiara Di Francescomarino
    • 3
  • Fabrizio Maria Maggi
    • 4
  1. 1.University of SannioBeneventoItaly
  2. 2.Unitelma Sapienza UniversityRomeItaly
  3. 3.FBK-IRSTTrentoItaly
  4. 4.University of TartuTartuEstonia

Personalised recommendations