A. M. Mironov, A. G. Miheev, V. E. Pyatetsky, “The algorithm of check of number of control flows in business process instance finiteness”, Probl. Upr., 2015, no. 1, 30

Problemy Upravleniya

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Probl. Upr.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Problemy Upravleniya, 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. Mironov^a, A. G. Miheev^b, V. E. Pyatetsky^b

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

Full-text PDF (811 kB)

References:

PDF

HTML

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.

Document Type: Article

UDC: 51-7

Language: Russian

Citation: A. M. Mironov, A. G. Miheev, V. E. Pyatetsky, “The algorithm of check of number of control flows in business process instance finiteness”, Probl. Upr., 2015, no. 1, 30–37

Citation in format AMSBIB

\Bibitem{MirMikPya15}

\by A.~M.~Mironov, A.~G.~Miheev, V.~E.~Pyatetsky

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

\jour Probl. Upr.

\yr 2015

\issue 1

\pages 30--37

\mathnet{http://mi.mathnet.ru/pu896}

Linking options:

https://www.mathnet.ru/eng/pu896

https://www.mathnet.ru/eng/pu/v1/p30

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Что такое QR-код?

Registration to the website

Logotypes