Analysis of Characteristics for Cyclic Business Processes


  • Lusine S. Tarumyan Yerevan State University


A new method for evaluation of business process characteristics is proposed, which is applicable at design stage when probabilities of process transitions are unknown. Among a variety of publications on the process analysis, only a few address processes under unknown probabilities of transitions. The latter consider only acyclic processes, which restricts their application scope.
The suggested method is based on a transformation of unstructured cycles into LOOP cycles. It gives an opportunity to represent a process via a hierarchy of LOOPs and to apply dynamic programming methodology for characteristics analysis. It allows to extend the algorithms, initially developed for acyclic processes, for the analysis of cyclic processes, preserving at the same time the polynomial complexity of source algorithms. The introduced method has been used to develop effective algorithms for determination of the main characteristics of a business process (including time, cost, revenue, and profit).

Author Biography

Lusine S. Tarumyan, Yerevan State University

IT Educational and Research Cente


W. van der Aalst, M. van H. Kees, Workflow Management, Models, Methods and Systems, The MITPress Cambridge, 2002.

H. Jonkers, H.M. Franken, “Quantitative modeling and analysis of business processes”, Simulation inIndustry, 8th European Simulation Symposium, vol.I, pp.175-179, 1996.

L. Tarumyan, “Timing analysis for workflow processes”, 17th European Simulation Symposium andExhibition Within I3M'05 International Mediterranean Modeling Multiconference, pp. 51-57, 2005.

W. van der Aalst, J. Desel, E. Kindler, “On the semantics of EPCs: A vicious circle”, Workshop onEPK, pp 7-18, 2003.

J. Koehler, R. Hauser, “Untangling unstructured cyclic flows - a solution based on continuations”, 6thInt. Conference on Cooperative Information Systems CoopIs, Springer LNCS 3290, pp. 121-138, 2004.

L. Tarumyan, “A System of performance characteristics analysis for business processes”, CSIT2011Eighth International Conference on Computer Science and Information technologies, pp. 198-201, 2011.

F. Dirk, C. Favre, B. Jobstmann, J. Koehler, N. Lohmann, H. Völzer, K. Wolf, “Instantaneoussoundness checking of industrial business process models”, 7th Int. Conference on Business ProcessManagement, Springer LNCS 5701, pp. 278-293, 2009.

J. Cardoso, A. Sheth, J. Miller, “Workflow quality of service”, International Conference onEnterprise Integration and Modeling Technology and International Enterprise Modeling Conference(ICEIMT/IEMC’02), 2002.

J. H. Son, M. H. Kim, “Analyzing the critical path for the well-formed workflow schema”, SeventhInternational Conference on Database Systems for Advanced Applications DASFAA, pp.146-147, 2001.

J. Eder, E. Panagos, “Managing time in workflow systems”, Workflow Handbook 2001, LayneFischer ed., ISBN 0-9703509-0-2, pp. 109-132, 2001.

F.E. Allen, J. Cocke, “A program data flow analysis procedure”, IBM Thomas J. Watson ResearchCenter, 1971.

J. Vanhatalo, H. Volzer, F. Leymann, “Faster and more focused control-flow analysis for businessprocess models though SESE decomposition”, ICSOC, Vol. 4749, pp. 43–55, 2007.

J. Vanhatalo, H. Völzer, J. Koehler, “The refined process structure tree”, Data & KnowledgeEngineering, v.68 n.9, pp.793-818, 2009.

R. Bellman. Dynamic Programming, Princeton University Press, 1957.

Workflow Management Coalition (WfMC), Workflow Standard – Process Definition Interchange,Process Model. WfMC TC-1016-P.Version 1.1, 1999.

F. Leymann, D. Roller, Production Workflow: concepts and techniques. Prentice Hall, 2000.

M. A Schaefer, Mathematical Theory of Global Program Optimization. Prentice-Hall,1973.

P. Raulefs, S. Shoukourian, L. Tarumyan, V Matevosyan, “Determination of critical paths inhammock type processes”, HPC‘2003, SCS International Advanced Simulation Technologies ConferenceASTC’2003, pp. 241-246, 2003.




How to Cite

Tarumyan, L. S. . (2021). Analysis of Characteristics for Cyclic Business Processes. Mathematical Problems of Computer Science, 36, 28–40. Retrieved from