Skip to main content
SpringerLink
Log in

An algorithm of automatic workflow optimization

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

This paper considers an algorithm of automatic workflow optimization that, unlike well-known redesign algorithms for workflows [1, 2], can analyze arbitrary structures containing conditional branches and cycles. This algorithm operates with workflows without structural conflicts and, in the course of operation, uses execution conditions obtained as a result of application of the Boolean verification algorithm (BVA) proposed earlier in [3]. A modified BVA is proposed and its computational complexity is estimated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Netjes, H., Reijers, H.A., and Aalst, W.M.P., On the Formal Generation of Process Redesigns, First Int. Workshop on Model-Driven Engineering For Business Process Management, 2008, pp. 49–60.

  2. Cao, H., Jin, H., Wu, S., and Tao, Y., PGWFT: A Petri Net Based Grid Workflow Verification and Optimization Toolkit, Third Int. Conf. on Advances in Grid and Pervasive Computing, 2008, pp. 48–58.

  3. Kalenkova, A.A., Application of If-Conversion to Verification and Optimization of Workflows, Programming Comput. Software, 2010, vol. 36, no. 5, pp. 276–288.

    Article  Google Scholar 

  4. Terminology & Glossary / Workflow Management Coalition, 1999. http://www.wfmc.org/Downloaddocument/WFMC-TC-1011-Ver-3-Terminology-and-Glossary-English.html

  5. Aalst, W.M.P., Hirnschall, A., and Verbeek, H.M.W., An Alternative Way to Analyze Workflow Graphs, Electronic Commerce Research, 2002, vol. 2, no. 3, pp. 195–231.

    Article  MATH  Google Scholar 

  6. Kalenkova, A.A., Optimization of the Execution Time of Workflows based on the Removal of Redundant Control Flows, Trudy MFTI, 2009, vol. 1, no. 2, pp. 160–175.

    Google Scholar 

  7. Evstigneev, V.A. and Kas’yanov, V.N., Svodimye grafy i graf-modeli v programmirovanii (Reducible Graphs and Graph-Models in Programming), Novosibirsk: IDMI, 1999.

    Google Scholar 

  8. Lin, H., Zhao, Z., Li, H., and Chen, Z., A Novel Graph Reduction Algorithm to Identify Structural Conflicts, Proc. of the 35th Annual Hawaii Int. Conf. on System Sciences, 2002, vol. 9, p. 289.

    Google Scholar 

  9. Bi, H.H. and Zhao, J.L., Applying Propositional Logic to Workflow Verification, Information Technology Management, 2004, vol. 5, nos. 3–4, pp. 293–318.

    Article  Google Scholar 

  10. Tolstov, E.V., Problems of Workflow Simulation Using Petri Nets, Cand. Sci. (Eng.) Dissertation, Moscow, 2006.

  11. Business Process Model and Notation (BPMN), FTF Beta 1 for Version 2.0, Object Management Group: 2009. http://www.omg.org/cgi-bin/doc?dtc/09-08-14. pdf

  12. OMG Unified Modeling LanguageTM (OMG UML), Superstructure. FTF Version 2.4, Object Management Group: 2010, http://www.omg.org/spec/UML/2.4/Infrastructure/Beta2/PDF

  13. Olkhovich, L., Semi-Automatic Business Process Performance Optimization Based On Redundant Control Flow Detection, Int. Conf. on Internet and Web Applications and Services / Advanced Int. Conf. on Telecommunications, 2006, p. 146.

  14. Kennedy, K. and Allen, J.R., Optimizing Compilers for Modern Architectures: A Dependence-Based Approach, San Francisco: Morgan Kaufmann, 2001.

    Google Scholar 

  15. Kalenkova, A.A., Serebryakov, V.A., and Bezdushnyi, A.N., A System of Automatic Verification and Optimization of Workflows, Telematics: Proc. of the XVII All-Russian Scientific-Methodical Conf., St. Petersburg State University of Information Technologies in Mechanics and Optics: St. Petersburg, 2010, pp. 381–382.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, Russia

    A. A. Kalenkova

Authors
  1. A. A. Kalenkova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Kalenkova.

Additional information

Original Russian Text © A.A. Kalenkova, 2012, published in Programmirovanie, 2012, Vol. 38, No. 1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalenkova, A.A. An algorithm of automatic workflow optimization. Program Comput Soft 38, 43–56 (2012). https://doi.org/10.1134/S0361768812010045

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768812010045

Keywords

Search

Navigation