Computation of alignments of business processes through relaxation labelling and local optimal search

A fundamental problem in conformance checking is aligning event data with process models. Unfortunately, existing techniques for this task are either complex, or can only be applicable to restricted classes of models. This in practice means that for large inputs, current techniques often fail to pro...

Descripción completa

Detalles Bibliográficos
Autores: Padró, Lluís|||0000-0003-4738-5019, Carmona Vargas, Josep|||0000-0001-9656-254X
Tipo de recurso: artículo
Fecha de publicación:2021
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/336365
Acceso en línea:https://hdl.handle.net/2117/336365
https://dx.doi.org/10.1016/j.is.2020.101703
Access Level:acceso abierto
Palabra clave:Business -- Data processing -- Mathematical models
Conformance checking
Process models
Event logs
Negocis -- Informàtica -- Models matemàtics
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
Descripción
Sumario:A fundamental problem in conformance checking is aligning event data with process models. Unfortunately, existing techniques for this task are either complex, or can only be applicable to restricted classes of models. This in practice means that for large inputs, current techniques often fail to produce a result. In this paper we propose a method to compute alignments for unconstrained process models, which relies on the use of relaxation labelling techniques on top of a partial order representation of the process model. The technique proposed in this paper precomputes information used in the search for alignments, and is able to produce real alignments that may be close to optimal ones by combining the aforementioned techniques with a locally applied A strategy. Remarkably, the implementation on the proposed technique achieves a speed-up of several orders of magnitude with respect to the approaches in the literature (either optimal, sup-optimal or approximate), often with a reasonable trade-off on the cost of the obtained alignment.