Abstract
The capability to store data about business processes execution in so-called Event Logs has brought to the diffusion of tools for the analysis of process executions and for the assessment of the goodness of a process model. Nonetheless, these tools are often very rigid in dealing with Event Logs that include incomplete information about the process execution. Thus, while the ability of handling incomplete event data is one of the challenges mentioned in the process mining manifesto, the evaluation of compliance of an execution trace still requires an end-to-end complete trace to be performed. This paper exploits the power of abduction to provide a flexible, yet computationally effective, framework to deal with different forms of incompleteness in an Event Log. Moreover it proposes a refinement of the classical notion of compliance into strong and conditional compliance to take into account incomplete logs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
For the sake of clarity we use BPMN, but our framework is language-independent.
- 3.
We often present the events in a trace ordered according to their execution time. This is only to enhance readability since the position of an event is fully determined by its timestamp, or unknown if the timestamp is missing.
- 4.
We slightly abuse the notation of \(\subseteq \), meaning that every positive atomic literal in \(\varDelta \) is the instance of a predicate in \(\mathcal {A} \).
- 5.
In the remainder of this paper we will assume that the time domain relies on natural numbers.
- 6.
We do not consider the abductive goal, as it is not needed for our treatment.
References
Aalst, W.: Process mining manifesto. In: Daniel, F., Barkaoui, K., Dustdar, S. (eds.) BPM 2011. LNBIP, vol. 99, pp. 169–194. Springer, Heidelberg (2012). doi:10.1007/978-3-642-28108-2_19
Adriansyah, A., van Dongen, B.F., van der Aalst, W.M.P.: Conformance checking using cost-based fitness analysis. In: Proceedings of EDOC. IEEE Computer Society (2011)
Leoni, M., Maggi, F.M., Aalst, W.M.P.: Aligning event logs and declarative process models for conformance checking. In: Barros, A., Gal, A., Kindler, E. (eds.) BPM 2012. LNCS, vol. 7481, pp. 82–97. Springer, Heidelberg (2012). doi:10.1007/978-3-642-32885-5_6
Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. J. Log. Comput. 2(6), 719–770 (1992). http://dblp.uni-trier.de/rec/bibtex/journals/logcom/KakasKT92
van der Aalst, W.M.P.: Process Mining - Discovery, Conformance and Enhancement of Business Processes. Springer, Heidelberg (2011)
Kiepuszewski, B., ter Hofstede, A.H.M., Bussler, C.J.: On structured workflow modelling. In: Bubenko, J., Krogstie, J., Pastor, O., Pernici, B., Rolland, C., Sølvberg, A. (eds.) 25 Years of CAiSE. Springer, Heidelberg (2013). doi:10.1007/978-3-642-36926-1_19
van der Aalst, W.M.P., Weijters, T., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 16, 1128–1142 (2004)
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Verifiable agent interaction in abductive logic programming: the SCIFF framework. ACM Trans. Comput. Log. 9(4), 29:1–29:43 (2008). http://dl.acm.org/citation.cfm?doid=1380572.1380578
On process mining, I.T.F.: XES standard definition (2015). http://www.xes-standard.org/
Di Francescomarino, C., Ghidini, C., Tessaris, S., Sandoval, I.V.: Completing workflow traces using action languages. In: Zdravkovic, J., Kirikova, M., Johannesson, J. (eds.) CAiSE 2015. LNCS, vol. 9097, pp. 314–330. Springer, Heidelberg (2015). doi:10.1007/978-3-319-19069-3_20
Kakas, A.C., Mancarella, P.: Abduction and abductive logic programming. In: Proceedings of ICLP (1994)
Fung, T.H., Kowalski, R.A.: The iff proof procedure for abductive logic programming. J. Log. Program. 33(2), 151–165 (1997). http://dblp.uni-trier.de/rec/bibtex/journals/jlp/FungK97
Alberti, M., Gavanelli, M., Lamma, E.: The CHR-based implementation of the SCIFF abductive system. Fundam. Inform. 124, 365–381 (2013)
Chesani, F., De Masellis, R., Di Francescomarino, C., Ghidini, C., Mello, P., Montali, M., Tessaris, S.: Abducing compliance of incomplete event logs. Technical report submit/1584687, arXiv (2016)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Kunen, K.: Negation in logic programming. J. Log. Program. 4(4), 289–308 (1987). http://dblp.uni-trier.de/rec/bibtex/journals/jlp/Kunen87
Clark, K.L.: Negation as Failure. In: Proceedings of Logic and Data Bases. Plenum Press (1978)
Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. J. Log. Program. 37(1–3), 1–46 (1998). http://dblp.uni-trier.de/rec/bibtex/journals/jlp/JaffarMMS98
Montali, M.: Specification and Verification of Declarative Open Interaction Models: A Logic-Based Approach. LNBIP, vol. 56. Springer, Heidelberg (2010)
Rogge-Solti, A., Mans, R.S., Aalst, W.M.P., Weske, M.: Improving documentation by repairing event logs. In: Grabis, J., Kirikova, M., Zdravkovic, J., Stirna, J. (eds.) PoEM 2013. LNBIP, vol. 165, pp. 129–144. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41641-5_10
Bertoli, P., Francescomarino, C., Dragoni, M., Ghidini, C.: Reasoning-based techniques for dealing with incomplete business process execution traces. In: Baldoni, M., Baroglio, C., Boella, G., Micalizio, R. (eds.) AI*IA 2013. LNCS (LNAI), vol. 8249, pp. 469–480. Springer, Heidelberg (2013). doi:10.1007/978-3-319-03524-6_40
Bagheri Hariri, B., Calvanese, D., De Giacomo, G., Deutsch, A., Montali, M.: Verification of relational data-centric dynamic systems with external services, pp. 163–174. ACM Press (2013)
De Masellis, R., Maggi, F.M., Montali, M.: Monitoring data-aware business constraints with finite state automata. In: Proceedings of ICSSP. ACM Press (2014)
Chesani, F., Mello, P., Montali, M., Storari, S.: Testing careflow process execution conformance by translating a graphical language to computational logic. In: Bellazzi, R., Abu-Hanna, A., Hunter, J. (eds.) AIME 2007. LNCS (LNAI), vol. 4594, pp. 479–488. Springer, Heidelberg (2007). doi:10.1007/978-3-540-73599-1_64
Montali, M., Pesic, M., van der Aalst, W.M.P., Chesani, F., Mello, P., Storari, S.: Declarative specification and verification of service choreographiess. TWEB 4(1), 3:1–3:62 (2010). http://dl.acm.org/citation.cfm?doid=1658373.1658376
Mian, U.S., den Hartog, J., Etalle, S., Zannone, N.: Auditing with incomplete logs. In: Proceedings of the 3rd Workshop on Hot Issues in Security Principles and Trust (2015)
Mancarella, P., Terreni, G., Sadri, F., Toni, F., Endriss, U.: The CIFF proof procedure for abductive logic programming with constraints: theory, implementation and experiments. TPLP 9(6), 691 (2009)
Kumar, A., Sabbella, S.R., Barton, R.R.: Managing controlled violation of temporal process constraints. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 280–296. Springer, Heidelberg (2015). doi:10.1007/978-3-319-23063-4_20
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Chesani, F. et al. (2016). Abducing Compliance of Incomplete Event Logs. In: Adorni, G., Cagnoni, S., Gori, M., Maratea, M. (eds) AI*IA 2016 Advances in Artificial Intelligence. AI*IA 2016. Lecture Notes in Computer Science(), vol 10037. Springer, Cham. https://doi.org/10.1007/978-3-319-49130-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-49130-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49129-5
Online ISBN: 978-3-319-49130-1
eBook Packages: Computer ScienceComputer Science (R0)