Generation of Synthetic Business Process Traces using Constraint Programming

Abstract

Juxtapositioning manually created business process models with diagrams generated using process discovery algorithms exposes high complexity of the latter. As a consequence, their formal verification requires significant computational resources due to a large state space. Nevertheless, an analysis of the generated model is needed to assure its correctness and the ability to represent source data. As a solution to this problem, we present an approach for constraint-based generation of a complete workflow log for a given BPMN model. In this paper, we propose a method to extract directed subgraphs representing token flows in the process together with a set of predefined constraints. Likewise, in the case of process simulation, these constraints ensure the correctness of the generated traces. Ultimately, the obtained results can be compared to the original workflow log used for process discovery in order to verify the obtained model.

Visualization of logical formulas

“…Satisfiability problem is a testing whether exists of a logical value assignment (true/1, false/0) to variables in a particular formula which will satisfy it, namely its logical value will be true. Those types of problems can be applied to many branches and are commonly used, for example in combinatorial optimization [2], graph theory, automated theorem proving, verification of software models [3], [4], [5], [6], and artificial/ambient intelligence [7], [8], [9].…”