Abstract
During the life-cycle of an Information System (IS) its actual behavior may not correspond to the original system model. However, to the IS support it is very important to have the latest model that reflects the current system behavior. To correct the model the information from the event log of the system may be used. In this paper, we consider the problem of process model adjustment (correction) using the information from event log. The input data for this task is the initial process model (a Petri net) and an event log. The result of correction should be a new process model, better reflecting the real IS behavior than the initial model. The new model could be also built from scratch, for example, with the help of one of the known algorithms for automatic synthesis of the process model from an event log. However, this may lead to crucial changes in the structure of the original model, and it will be difficult to compare the new model with the initial one, hindering its understanding and analysis. Then it is important to keep the initial structure of the model as much as possible. In this paper we propose a method for process model correction based on the principle of “divide and conquer”. The initial model is decomposed into several fragments. For each of the fragments its conformance to the event log is checked. Fragments, which do not match the log, are replaced by newly synthesized ones. The new model is then assembled from the fragments via transition fusion. The experiments demonstrate that our correction algorithm gives good results when it is used for correcting local discrepancies. The paper presents the description of the algorithm, the formal justification for its correctness, as well as the results of experimental testing on artificial examples.
Highlights
its actual behaviour may not correspond to the original system model
we consider the problem of process model adjustment
The new model could be also built from scratch
Summary
Описание постановки задачи по корректировке модели процесса начнем с мотивирующего примера. Рассмотрим модель процесса в виде сети Петри на Рис. В частности, автоматически синтезирована по следующему логу событий: [ a, b, c, d, e, f, g , a, b, d, c, e, f, g , a, b, c, d, e, h, b, d, c, g, f ]. Время выполнения событий используется только для их упорядочения и может быть опущено. Предположим, что данный лог событий был дополнен трассой a, c, b, e, f, g , которая не может быть воспроизведена в модели. В этой новой трассе действие Проверка билета b выполняется после действия Рядовая проверка c, что не соответствует порядку их выполнения в исходной модели на Рис. Даны сеть Петри N это исходная модель процесса, и лог событий L, представляющий текущее поведение процесса. – модели N и N r имеют похожую графовую структуру (сходство моделей)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
