Skip to main content

An Efficient Algorithm for Workflow Graph Structural Verification

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2008 (OTM 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5331))

Abstract

Any big enterprise is organized around business process having a value towards its customers and its products. Appropriate definition, analysis, checking and improvement of those business process models are indispensable before their deployment within workflow management systems. In this paper, we focus on business process model verification that insures business process structural correctness. Our proposal consist in a new efficient hybrid algorithm of workflow graph structural validation combining graph reduction and traversal mechanisms. Our algorithm will be disussed and compared to existing workflow structural checking approaches from completeness and performance points of view.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sadiq, S., Orlowska, M., Sadiq, W., Foulger, C.: Data flow and validation in workflow modelling. In: ADC 2004: Proceedings of the 15th Australasian database conference, Darlinghurst, Australia, pp. 207–214. Australian Computer Society, Inc. (2004)

    Google Scholar 

  2. WFMC-TC-1011, D.N.: The workflow management coalition specification workflow management coalition interface 1: Process definition interchange process model (1996)

    Google Scholar 

  3. WFMC-TC-1016, D.N.: Workflow management coalition interface 1: Process definition interchange process model (1999)

    Google Scholar 

  4. Sadiq, W., Orlowska, M.E.: Analyzing process models using graph reduction techniques. Inf. Syst. 25(2), 117–134 (2000)

    Article  Google Scholar 

  5. Sadiq, W., Orlowska, M.E.: Applying graph reduction techniques for identifying structural conflicts in process models. In: Jarke, M., Oberweis, A. (eds.) CAiSE 1999. LNCS, vol. 1626, pp. 195–209. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. van der Aalst, W.M.P., Hirnschall, A., Verbeek, H.M.W.E.: An alternative way to analyze workflow graphs. In: CAiSE, pp. 535–552 (2002)

    Google Scholar 

  7. Lin, H., Zhao, Z., Li, H., Chen, Z.: A novel graph reduction algorithm to identify structural conflicts. In: HICSS, p. 289 (2002)

    Google Scholar 

  8. Perumal, S., Mahanti, A.: A graph-search based algorithm for verifying workflow graphs. In: DEXA Workshops, pp. 992–996. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  9. Perumal, S., Mahanti, A.: Applying graph search techniques for workflow verification. In: HICSS, p. 48 (2007)

    Google Scholar 

  10. Liu, R., Kumar, A.: An analysis and taxonomy of unstructured workflows. In: Business Process Management, pp. 268–284 (2005)

    Google Scholar 

  11. Baïna, K., Gaaloul, W., Khattabi, R.E., Mouhou, A.: Workflowminer: a new workflow patterns and performance analysis tool. In: Boudjlida, N., Cheng, D., Guelfi, N. (eds.) CAiSE Forum. CEUR Workshop Proceedings, vol. 231 (2006), CEUR-WS.org

  12. Gaaloul, W., Baïna, K., Godart, C.: Log-based mining techniques applied to web service composition reengineering. Service Oriented Computing and Applications 2(2-3), 93–110 (2008)

    Article  Google Scholar 

  13. jBPM, http://www.jbpm.org

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Touré, F., Baïna, K., Benali, K. (2008). An Efficient Algorithm for Workflow Graph Structural Verification. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems: OTM 2008. OTM 2008. Lecture Notes in Computer Science, vol 5331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88871-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88871-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88870-3

  • Online ISBN: 978-3-540-88871-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics