Investigations on Soundness Regarding Lazy Activities

  • Frank Puhlmann
  • Mathias Weske
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4102)

Abstract

Current approaches for proving the correctness of business processes focus on either soundness, weak soundness, or relaxed soundness. Soundness states that each activity should be on a path from the initial to the final activity, that after the final activity has been reached no other activities should become active, and that there are no unreachable activities. Relaxed soundness softens soundness by stating that each activity should be able to participate in the business process, whereas weak soundness allows unreachable activities. However, all these kinds of soundness are not satisfactory for processes containing discriminator, n-out-of-m-join or multiple instances without synchronization patterns that can leave running (lazy) activities behind. As these patterns occur in interacting business processes, we propose a solution based on lazy soundness. We utilize the π-calculus to discuss and implement reasoning on lazy soundness.

Keywords

Business Process Multiple Instance Business Process Management Initial Node Business Process Modeling Notation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M.: Business Process Management: A Survey. In: van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M. (eds.) BPM 2003. LNCS, vol. 2678, pp. 1–12. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Burbeck, S.: The Tao of e-business services (2000), available at: http://www-128.ibm.com/developerworks/library/ws-tao/
  3. 3.
    van der Aalst, W.M.P.: Verification of Workflow Nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Dehnert, J., Rittgen, P.: Relaxed Soundness of Business Processes. In: Dittrich, K.R., Geppert, A., Norrie, M.C. (eds.) CAiSE 2001. LNCS, vol. 2068, pp. 157–170. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Martens, A.: On Compatibility of Web Services. Petri Net Newsletter 65, 12–20 (2003)Google Scholar
  6. 6.
    van der Aalst, W., van Hee, K.: Workflow Management. MIT Press, Cambridge (2002)Google Scholar
  7. 7.
    Barros, A., Dumas, M., ter Hofstede, A.: Service Interaction Patterns. In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol. 3649, pp. 302–318. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Puhlmann, F., Weske, M.: Using the Pi-Calculus for Formalizing Workflow Patterns. In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol. 3649, pp. 153–168. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Part I/II. Information and Computation 100, 1–77 (1992)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.: Workflow Patterns. Technical Report BETA Working Paper Series, WP 47, Eindhoven University of Technology (2000)Google Scholar
  11. 11.
    van der Aalst, W.M.P., ter Hofstede, A.H.M.: YAWL: Yet Another Workflow Language (Revised version. Technical Report FIT-TR-2003-04, Queensland University of Technology, Brisbane (2003)Google Scholar
  12. 12.
    Verbeek, H., van der Aalst, W., ter Hofstede, A.: Verifying Workflows with Cancellation Regions and OR-joins: An Approach based on Invariants, BETA Working Paper Series, WP 156. Technical report, Eindhoven University of Technology, Eindhoven, The Netherlands (2006)Google Scholar
  13. 13.
    Puhlmann, F.: Why do we actually need the Pi-Calculus for Business Process Management? In: Proceedings of the 9th International Conference on Business Information Systems (to appear, 2006)Google Scholar
  14. 14.
    Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes, Paperback edn. Cambridge University Press, Cambridge (2003)Google Scholar
  15. 15.
    Sangiorgi, D.: A Theory of Bisimulation for the Pi-Calculus. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 127–142. Springer, Heidelberg (1993)Google Scholar
  16. 16.
    Overdick, H., Puhlmann, F., Weske, M.: Towards a Formal Model for Agile Service Discovery and Integration. In: Verma, K., Sheth, A., Zaremba, M., Bussler, C. (eds.) Proceedings of the International Workshop on Dynamic Web Processes (DWP 2005). IBM technical report RC23822, Amsterdam (2005)Google Scholar
  17. 17.
    BPMI.org.: Business Process Modeling Notation. 1.0 edn. (2004)Google Scholar
  18. 18.
    Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol. 1. Addison Wesley, Reading (1997)Google Scholar
  19. 19.
    Victor, B., Faron Moller, M.D., Eriksson, L.H.: The Mobility Workbench (2005), available at: http://www.it.uu.se/research/group/mobility/mwb
  20. 20.
    Briais, S.: ABC Bisimulation Checker (2003), available at: http://lamp.epfl.ch/~sbriais/abc/abc.html
  21. 21.
    Frendrup, U., Jensen, J.N., Hüttel, H.: OBC Workbench (2001), available at: http://www.cs.auc.dk/research/FS/ny/PR-pi/
  22. 22.
    Wynn, M., Edmond, D., van der Aalst, W., ter Hofstede, A.: Achieving a General, Formal and Decidable Approach to the OR-join in Workflow using Reset nets (2005)Google Scholar
  23. 23.
    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)CrossRefGoogle Scholar
  24. 24.
    van der Aalst, W.M.P., Weske, M.: The P2P Approach to Interorganizational Workflow. In: Dittrich, K.R., Geppert, A., Norrie, M.C. (eds.) CAiSE 2001. LNCS, vol. 2068, pp. 140–156. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Frank Puhlmann
    • 1
  • Mathias Weske
    • 1
  1. 1.Business Process Technology GroupHasso-Plattner-Institute for IT Systems Engineering, at the University of PotsdamPotsdamGermany

Personalised recommendations