Skip to main content

Semantics of Standard Process Models with OR-Joins

  • Conference paper

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

Abstract

The Business Process Modeling Notation (BPMN) is an emerging standard for capturing business processes. Like its predecessors, BPMN lacks a formal semantics and many of its features are subject to interpretation. One construct of BPMN that has an ambiguous semantics is the OR-join. Several formal semantics of this construct have been proposed for similar languages such as EPCs and YAWL. However, these existing semantics are computationally expensive. This paper formulates a semantics of the OR-join in BPMN for which enablement of an OR-join in a process model can be evaluated in quadratic time in terms of the total number of elements in the model. This complexity can be reduced down to linear-time after materializing a quadratic-sized data structure at design-time. The paper also shows how to efficiently detect the enablement of an OR-join incrementally as the execution of a process instance unfolds.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van der Aalst, W.M.P., Desel, J., Kindler, E.: On the Semantics of EPCs: A Vicious Circle. In: Rump, M., Nüttgens, F.J. (eds.) Proceedings of the EPK 2002: Business Process Management using EPCs, Trier, Germany, pp. 71–80. Gesellschaft für Informatik (2002)

    Google Scholar 

  2. van der Aalst, W.M.P., ter Hofstede, A.H.M, Kiepuszewski, B., Barros, A.P.: Workflow Patterns. Distributed and Parallel Databases 14, 5–51 (2003)

    Article  Google Scholar 

  3. van Breugel, F., Koshkina, M.: Models and verification of BPEL. Working paper (September 2006), http://www.cse.yorku.ca/~franck/research/drafts/tutorial.pdf

  4. Cuntz, N., Freiheit, J., Kindler, E.: On the semantics of EPCs: Faster calculation for EPCs with small state spaces. In: Nüttgens, F.J., Rump, M. (eds.) Proceedings of EPK 2005, Hamburg, pp. 7–23 (December 2005)

    Google Scholar 

  5. Cuntz, N., Kindler, E.: On the semantics of EPCs: Efficient calculation and simulation. In: Nüttgens, F.J., Rump, M. (eds.) Proceedings of EPK 2004, pp. 7–26 (October 2004)

    Google Scholar 

  6. Cuntz, N., Kindler, E.: On the semantics of EPCs: Efficient calculation and simulation (Extended Abstract). In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol. 3649, pp. 398–403. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Dijkman, R.M., Dumas, M., Ouyang, C.: Formal semantics and automated analysis of BPMN process models. Preprint 5969, Queensland University of Technology (January 2007), https://eprints.qut.edu.au/archive/00005969

  8. Eastman Software. RouteBuilder Tool User’s Guide. Eastman Software, Inc, Billerica, MA, USA (1998)

    Google Scholar 

  9. Jordan, D., Evdemon, J. (eds.): Web Services Business Process Execution Language Version 2.0. OASIS WS-BPEL TC (2005), http://www.oasis-open.org/committees/tc_home.php?wg_abbrev=wsbpel

  10. Kindler, E.: On the Semantics of EPCs: A Framework for Resolving the Vicious Circle. In: Desel, J., Pernici, B., Weske, M. (eds.) BPM 2004. LNCS, vol. 3080, pp. 82–97. Springer, Heidelberg (2004)

    Google Scholar 

  11. Kindler, E.: On the Semantics of EPCs: Resolving the Vicious Circle. Data and Knowledge Engineering 56(1), 23–40 (2006)

    Article  Google Scholar 

  12. Mendling, J., van der Aalst, W.M.P.: Formalization and Verification of EPCs with OR-Joins based on State and Context. In: CAiSE 2007. Proceedings of the 19th International Conference on Advanced Information Systems Engineering, Trondheim, Norway, Springer, Heidelberg (to appear, 2007)

    Google Scholar 

  13. OMG. Business Process Modeling Notation (BPMN) Version 1.0. OMG Final Adopted Specification. OMG (February 2006), http://www.bpmn.org/

  14. Reis, S., Metzger, A., Pohl, K.: Integration testing in software product line engineering. In: FASE. Proceedings of the 10th International Conference on Fundamental Approaches to Software Engineering, Braga, Portugal, Springer, Heidelberg (2007)

    Google Scholar 

  15. Russell, N., ter Hofstede, A.H.M., van der Aalst, W.M.P., Mulyar, N.: Workflow control flow patterns: A revised view. BPMCenter Technical report BPM-06-22, BPMCenter.org (2006)

    Google Scholar 

  16. Silver, B.: The 2006 BPMS Report: Understanding and Evaluating BPM Suites (2006), http://www.bpminstitute.org/bpmsreport.html

  17. Wong, P.Y.H., Gibbons, J.: A process semantics for BPMN. Preprint, Oxford University Computing Laboratory (March 2007), http://web.comlab.ox.ac.uk/oucl/work/peter.wong/pub/bpmn_extended.pdf

  18. Wynn, M.T.: Semantics, Verification, and Implementation of Workflows with Cancellation Regions and OR-joins. PhD Thesis, Faculty of Information Technology, Queensland University of Technology (November 2006)

    Google Scholar 

  19. Wynn, M.T., Edmond, D., van der Aalst, W.M.P., ter Hofstede, A.H.M: Achieving a General, Formal and Decidable Approach to the OR-join in Workflow using Reset nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 423–443. Springer, Heidelberg (2005)

    Google Scholar 

  20. Wynn, M.T., Edmond, D., van der Aalst, W.M.P., ter Hofstede, A.H.M.: Achieving a General, Formal and Decidable Approach to the OR-join in Workflow using Reset nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 423–443. Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Robert Meersman Zahir Tari

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dumas, M., Grosskopf, A., Hettel, T., Wynn, M. (2007). Semantics of Standard Process Models with OR-Joins. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS. OTM 2007. Lecture Notes in Computer Science, vol 4803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76848-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76848-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-76848-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics