Skip to main content

Faster Or-Join Enactment for BPMN 2.0

  • Conference paper
Business Process Model and Notation (BPMN 2011)

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 95))

Included in the following conference series:

Abstract

We propose an efficient algorithm that enacts the control-flow of BPMN, in particular the inclusive Or-join gateway. The original algorithm for enacting Or-joins in BPMN 2.0 needs, upon each token move in the diagram, linear time in the number of edges of the diagram to find out whether a given Or-join is enabled, whereas our proposal essentially needs only constant time to do so.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Bravetti, M., Bultan, T. (eds.): WS-FM 2010. LNCS, vol. 6551. Springer, Heidelberg (2011)

    Google Scholar 

  2. Christiansen, D.R., Carbone, M., Hildebrandt, T.: Formal semantics and implementation of bpmn 2.0 inclusive gateways. In: Bravetti, Bultan (eds.) [1], pp. 146–160

    Google Scholar 

  3. Dumas, M., Grosskopf, A., Hettel, T., Wynn, M.T.: Semantics of Standard Process Models with OR-Joins. In: Meersman, R., Tari, Z. (eds.) OTM 2007, Part I. LNCS, vol. 4803, pp. 41–58. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. OMG. Business process model and notation (BPMN) version 2.0, OMG document number dtc/2010-05-03. Technical report (2010)

    Google Scholar 

  5. Polyvyanyy, A., Vanhatalo, J., Völzer, H.: Simplified computation and generalization of the refined process structure tree. In: Bravetti, Bultan (eds.) [1], pp. 25–41

    Google Scholar 

  6. Vanhatalo, J., Völzer, H., Koehler, J.: The refined process structure tree. Data Knowl. Eng. 68(9), 793–818 (2009)

    Article  Google Scholar 

  7. Vanhatalo, J., Völzer, H., Leymann, F.: Faster and More Focused Control-Flow Analysis for Business Process Models through SESE Decomposition. In: Krämer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 43–55. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Völzer, H.: A New Semantics for the Inclusive Converging Gateway in Safe Processes. In: Hull, R., Mendling, J., Tai, S. (eds.) BPM 2010. LNCS, vol. 6336, pp. 294–309. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gfeller, B., Völzer, H., Wilmsmann, G. (2011). Faster Or-Join Enactment for BPMN 2.0. In: Dijkman, R., Hofstetter, J., Koehler, J. (eds) Business Process Model and Notation. BPMN 2011. Lecture Notes in Business Information Processing, vol 95. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25160-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25160-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25159-7

  • Online ISBN: 978-3-642-25160-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics