RUS  ENG
Full version
JOURNALS // Problemy Upravleniya // Archive

Probl. Upr., 2015 Issue 1, Pages 30–37 (Mi pu896)

Information technologies controls

The algorithm of check of number of control flows in business process instance finiteness

A. M. Mironova, A. G. Miheevb, V. E. Pyatetskyb

a Institute for Problems of Informatics of RAS, Moscow
b National University of Science and Technology MISIS, Moscow

Abstract: Due to errors in business process development in contemporary computerized business process management systems there is a chance of unlimited growth of control flows number in business process instance that can lead to unjustified overload of computer system resources. The paper reviews the task of business process scheme analysis is in order to avoid such situation and proposes the algorithm of checking if there is a finite number of control flows.

Keywords: executable business processes, business process management systems, control flow, directed graph.

UDC: 51-7



© Steklov Math. Inst. of RAS, 2024