Resumen
The paper discusses the problem of process mining with further anomalies detection for constructed process models. The algorithms extension for the case of several running processes with some restrictions on their structure has been investigated. An acyclic directed graph is considered as a formal model for a process. The event log traces containing the data from one and several processes were examined. The complexity problem of detecting anomalies is studied, for the cases when the processes consist of various actions sets and when the intersection of the actions sets of the processes is a finite set. The applicability limitations of the proposed algorithms? extension are found. The complexity estimates for the formal models? construction of a set of processes problem and for anomaly detection with constructed formal models? problem are determined. For the case when data from several processes are encountered within the same trace some additional estimates are given, concerning the additional required memory and the minimum size of the log.