Automated repair of process models with non-local constraints using state-based region theory

State-of-the-art process discovery methods construct free-choice process models from event logs. Consequently, the constructed models do not take into account indirect dependencies between events. Whenever the input behaviour is not free-choice, these methods fail to provide a precise model. In this paper, we propose a novel approach for enhancing free-choice process models by adding non-free-choice constructs discovered a-posteriori via region-based techniques. This allows us to benefit from the performance of existing process discovery methods and the accuracy of the employed fundamental synthesis techniques. We prove that the proposed approach preserves fitness with respect to the event log while improving the precision when indirect dependencies exist. The approach has been implemented and tested on both synthetic and real-life datasets. The results show its effectiveness in repairing models discovered from event logs.This work was partly supported by the Australian Research Council Discovery Project DP180102839. This work was supported by MINECO and FEDER funds under grant TIN2017-86727-C2-1-R.Peer ReviewedPostprint (author's final draft

A graph-theoretical characterisation of state separation

Region theory, as initiated by Ehrenfeucht and Rozenberg, allows the characterisation of the class of Petri net synthesisable finite labelled transition systems. Regions are substructures of a transition system which come in two varieties: ones solving event/state separation problems, and ones solving state separation problems. Linear inequation systems can be used in order to check the solvability of these separation problems. In the present paper, the class of finite labelled transition systems in which all state separation problems are solvable shall be characterised graph-theoretically, rather than linear-algebraically.SCOPUS: cp.kinfo:eu-repo/semantics/publishe