Skip to main content
SpringerLink
Log in

Application of if-conversion to verification and optimization of workflows

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

Abstract

Based on the workflow analysis graphs proposed in [1] and the well-known if-conversion method [2], a new algorithm of workflow verification is developed. This algorithm is based on the Boolean algebra principles, which is reflected in its name—Boolean Verification Algorithm (BVA). The BVA operates with arbitrary overlapping structures of the graph and with cycles. In the case of dense graphs, the time complexity of the algorithm does not exceed that of most other algorithms of workflow verification [3–6]. In the course of verification, the BVA determines an execution condition for each node of the graph, which makes it possible to create an additional algorithm of workflow optimization. Unlike the well-known algorithms of structural workflow optimization based on pattern transformations [7, 8], the proposed optimization algorithm allows for maximum (within a cycle) parallelization of workflows containing arbitrary overlapping structures.

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. 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 

  2. Allen, J.R., Kennedy, K., Porterfield, C., and Warren, J., Conversion of Control Dependence to Data Dependence, Tenth Annual ACM Symp. on the Principles of Programming Languages, 1983, pp. 177–189.

  3. 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 

  4. 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 

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

    Article  Google Scholar 

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

  7. Netjes, M., Reijers, H.A., and Aaslt, 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.

  8. 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.

  9. Terminology and Glossary / Workflow Management Coalition, 1999. http://www.wfmc.org/Download-document/WFMC-TC-1011-Ver-3-Terminology-and-Glossary-English.html.

  10. Voevodin, V.V. and Voevodin, Vl.,V., Parellel’nye vychisleniya (Parallel Computing), St.Petersburg: BHV-Peterburg, 2004.

    Google Scholar 

  11. Aalst, W.M.P., Hofstede A.H.M., Kiepuszewski, B., and Barros, A.P., Workflow Patterns, Distributed and Parallel Databases, 2003, vol. 14, no. 3, pp. 5–51.

    Article  Google Scholar 

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

    Google Scholar 

  13. Web Services Buisiness Process Execution Language Version 2.0, 2007 (Eds. Alves, A., Arkin, A., and Askary, S.), http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html.

  14. Process Definition Interface — XML Process Definition Language 0.03, 2001 (Eds. Marin, M., Norin, R., and Shapiro, R.), http://xml.coverpages.org/XPDL20010522.pdf.

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

  16. Coreman, T., Leiserson, Ch., Rivest, R., and Stein, K., Introduction to Algorithms, Prentice-Hall, 2006. Translated under the title Algoritmy: postroenie i analiz, Moscow: Vil’yams, 2007.

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

    Google Scholar 

  18. Aho, A.V., Sethi, J.E., and Ulman, J.D., Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986. Translated under the title Kompilyatory: printsipy, tekhnologii, instrumenty, Moscow: Vil’yams, 2003.

  19. Dese, J. and Esparza, J., Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, 1995, vol. 40, p. 242.

    Google Scholar 

  20. Sadiq, W. and Orlowska, M.E., Analyzing Process Models Using Graph Reduction Techniques, The 11th Int. Conf. on Advanced Information Systems Engineering, 2000, vol. 25, pp. 117–134.

    Google Scholar 

  21. GeoNames, http://www.geonames.org/.

  22. ArcWeb Services, http://www2.arcwebservices.com/v2006/index.jsp.

Download references

Author information

Authors and Affiliations

  1. Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119991, 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, 2010, published in Programmirovanie, 2010, Vol. 36, No. 5.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalenkova, A.A. Application of if-conversion to verification and optimization of workflows. Program Comput Soft 36, 276–288 (2010). https://doi.org/10.1134/S0361768810050038

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation