Skip to main content

Dynamic Skipping and Blocking and Dead Path Elimination for Cyclic Workflows

  • Conference paper
  • First Online:
Business Process Management (BPM 2016)

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

Included in the following conference series:

Abstract

We propose and study dynamic versions of the classical flexibility constructs skip and block and motivate and define a formal semantics for them. We show that our semantics for dynamic blocking is a generalization of classical dead-path-elimination and solves the long-standing open problem to define dead-path elimination for cyclic workflows. This gives rise to a simple and fully local semantics for inclusive gateways.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, New York (1995)

    Book  MATH  Google Scholar 

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

  3. Fahland, D., van der Aalst, W.M.P.: Model repair - aligning process models to reality. Inf. Syst. 47, 220–243 (2015)

    Article  Google Scholar 

  4. Fahland, D., Völzer, H.: Dynamic Skipping and Blocking and Dead Path Elimination for Cyclic Workflows (Ext. Version). BPM Center Report BPM-16-05 (2016). http://bpmcenter.org

    Google Scholar 

  5. Favre, C., Fahland, D., Völzer, H.: The relationship between workflow graphs and free-choice workflow nets. Inf. Syst. 47, 197–219 (2015)

    Article  Google Scholar 

  6. Genrich, H.J., Thiagarajan, P.S.: A theory of bipolar synchronization schemes. Theor. Comput. Sci. 30, 241–318 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gottschalk, F., van der Aalst, W.M.P., Jansen-Vullers, M.H., La Rosa, M.: Configurable workflow models. Int. J. Coop. Inf. Syst. 17(2), 177–221 (2008)

    Article  Google Scholar 

  8. Kemper, P., Bause, F.: An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 263–278. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  9. Kindler, E.: On the semantics of EPCs: resolving the vicious circle. Data Knowl. Eng. 56(1), 23–40 (2006)

    Article  Google Scholar 

  10. Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

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

    Google Scholar 

  12. Reichert, M., Dadam, P.: ADEPT\({}_{\text{ flex }}\)-supporting dynamic changes of workflows without losing control. J. Intell. Inf. Syst. 10(2), 93–129 (1998)

    Article  Google Scholar 

  13. Reichert, M., Weber, B.: Enabling Flexibility in Process-Aware Information Systems - Challenges, Methods, Technologies. Springer, Heidelberg (2012)

    Book  MATH  Google Scholar 

  14. La Rosa, M., van der Aalst, W.M.P., Dumas, M., Milani, F.P.: Business process variability modeling: a survey. QUT e-Print 61842, QUT, Australia (2013)

    Google Scholar 

  15. van Breugel, F., Koshkina, M.: Dead-path-elimination in BPEL4WS. In: Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 6–9 June 2005, St. Malo, France, pp. 192–201. IEEE Computer Society (2005)

    Google Scholar 

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

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

  18. Weidlich, M., Großkopf, A., Barros, A.P.: Realising dead path elimination in BPMN. In: 2009 IEEE Conference on Commerce and Enterprise Computing, CEC 2009, Vienna, Austria, 20–23 July 2009, pp. 345–352. IEEE Computer Society (2009)

    Google Scholar 

  19. Weske, M.: Workflow management systems: formal foundation, conceptual design, implementation aspects. Habilitationsschrift Fachbereich Mathematik und Informatik, Universität Münster (2000)

    Google Scholar 

  20. Weske, M.: Formal foundation and conceptual design of dynamic adaptations in a workflow management system. In: 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 3–6 January 2001, Maui, Hawaii, USA. IEEE Computer Society (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dirk Fahland .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Fahland, D., Völzer, H. (2016). Dynamic Skipping and Blocking and Dead Path Elimination for Cyclic Workflows. In: La Rosa, M., Loos, P., Pastor, O. (eds) Business Process Management. BPM 2016. Lecture Notes in Computer Science(), vol 9850. Springer, Cham. https://doi.org/10.1007/978-3-319-45348-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45348-4_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45347-7

  • Online ISBN: 978-3-319-45348-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics