Ensuring Model Consistency in Declarative Process Discovery
Declarative process models define the behaviour of business processes as a set of constraints. Declarative process discovery aims at inferring such constraints from event logs. Existing discovery techniques verify the satisfaction of candidate constraints over the log, but completely neglect their interactions. As a result, the inferred constraints can be mutually contradicting and their interplay may lead to an inconsistent process model that does not accept any trace. In such a case, the output turns out to be unusable for enactment, simulation or verification purposes. In addition, the discovered model contains, in general, redundancies that are due to complex interactions of several constraints and that cannot be solved using existing pruning approaches. We address these problems by proposing a technique that automatically resolves conflicts within the discovered models and is more powerful than existing pruning techniques to eliminate redundancies. First, we formally define the problems of constraint redundancy and conflict resolution. Thereafter, we introduce techniques based on the notion of an automata-product monoid that guarantee the consistency of the discovered models and, at the same time, keep the most interesting constraints in the pruned set. We evaluate the devised techniques on real-world benchmarks.
KeywordsReduction Rule Support Threshold Inductive Logic Programming Redundant Constraint Interest Factor
Unable to display preview. Download preview PDF.
- 3.Bellodi, E., Riguzzi, F., Lamma, E.: Probabilistic logic-based process mining. In: CILC (2010)Google Scholar
- 6.Di Ciccio, C., Maggi, F.M., Mendling, J.: Discovering target-branched declare constraints. In: Sadiq, S., Soffer, P., Völzer, H. (eds.) BPM 2014. LNCS, vol. 8659, pp. 34–50. Springer, Heidelberg (2014) Google Scholar
- 7.Di Ciccio, C., Mecella, M.: A two-step fast algorithm for the automated discovery of declarative workflows. In: CIDM, pp. 135–142. IEEE (2013)Google Scholar
- 9.van Dongen, B.F.: Real-life event logs - a loan application process. BPIC (2012)Google Scholar
- 11.Felfernig, A., Zehentner, C., Blazek, P.: Corediag: eliminating redundancy in constraint sets. In: DX, pp. 219–224 (2011)Google Scholar
- 13.Junker, U.: QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In: AAAI, pp. 167–172 (2004)Google Scholar
- 17.Maggi, F.M., Mooij, A.J., van der Aalst, W.M.P.: User-guided discovery of declarative process models. In: CIDM, pp. 192–199 (2011)Google Scholar
- 18.Prescher, J., Di Ciccio, C., Mendling, J.: From declarative processes to imperative models. In: SIMPDA, vol. 1293, pp. 162–173. CEUR-WS.org (2014)Google Scholar