A Restructuring Method for WS-BPEL Business Processes Based on Extended Workflow Graphs

  • Thomas S. Heinze
  • Wolfram Amme
  • Simon Moser
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5701)

Abstract

Much research effort has been spent on the provision of analysis methods for business processes specified by means of Web Services Business Process Execution Language (WS-BPEL). Nevertheless, most approaches neglect conditional control flow, though running the risk of erroneous analysis results. In this paper, we present a restructuring approach for WS-BPEL processes, which helps to partly remedy conditional control flow. We therefore use a combination of workflow graphs and Concurrent Static Single Assignment Form. Based on the hybrid format, we are able to identify loops with static quasi-constant loop condition and transform them in such a way, that conditional control flow is replaced by unconditional control flow. Augmenting an existing analysis with the proposed restructuring then enables more precise results, as is shown for a compatibility analysis of WS-BPEL business processes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alves, A., Arkin, A., Askary, S., Barreto, C., Bloch, B., Curbera, F., Ford, M., Goland, Y., Guízar, A., Kartha, N., Liu, C.K., Khalaf, R., König, D., Marin, M., Mehta, V., Thatte, S., van der Rijn, D., Yendluri, P., Yiu, A.: Web Services Business Process Execution Language Version 2.0. Standard, OASIS (April 2007)Google Scholar
  2. 2.
    van Breugel, F., Koshkina, M.: Models and Verification of BPEL (September 2006)Google Scholar
  3. 3.
    Martens, A., Moser, S., Gerhardt, A., Funk, K.: Analyzing Compatibility of BPEL Processes. In: Advanced Int. Conf. on Telecommunications and Int. Conf. on Internet and Web Applications and Services, p. 147. IEEE, Los Alamitos (2006)Google Scholar
  4. 4.
    van der Aalst, W.M.P.: Structural Characterizations of Sound Workflow Nets. Computing Science Report 96/23, Eindhoven University of Technology (1996)Google Scholar
  5. 5.
    Lohmann, N.: A Feature-Complete Petri Net Semantics for WS-BPEL 2.0 and its Compiler BPEL2oWFN. Techn. report 212, Humboldt University of Berlin (2007)Google Scholar
  6. 6.
    Moser, S., Martens, A., Görlach, K., Amme, W., Godlinski, A.: Advanced Verification of Distributed WS-BPEL Business Processes Incorporating CSSA-based Data Flow Analysis. In: 2007 IEEE Int. Conf. on Services Computing. IEEE, Los Alamitos (2007)Google Scholar
  7. 7.
    van der Aalst, W.M.P., Hirnschall, A., Verbeek, H.M.W(E.): An Alternative Way to Analyze Workflow Graphs. In: Pidduck, A.B., Mylopoulos, J., Woo, C.C., Ozsu, M.T. (eds.) CAiSE 2002. LNCS, vol. 2348, pp. 535–552. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Sadiq, W., Orlowska, M.E.: Analyzing Process Models Using Graph Reduction Techniques. Information Systems 25(2), 117–134 (2000)CrossRefGoogle Scholar
  9. 9.
    Lee, J., Midkiff, S.P., Padua, D.A.: Concurrent Static Single Assignment Form and Constant Propagation for Explicitly Parallel Programs. In: Carter, L., Ferrante, J., Sehr, D., Chatterjee, S., Prins, J.F., Li, Z., Yew, P.-C. (eds.) LCPC 1998. LNCS, vol. 1656, pp. 114–130. Springer, Heidelberg (1999)Google Scholar
  10. 10.
    Heinze, T.S., Amme, W., Moser, S.: Resolving Conditional Branches in WS-BPEL Business Processes. Report, Friedrich Schiller University of Jena (to appear)Google Scholar
  11. 11.
    Heinze, T.S., Amme, W., Moser, S.: Generic CSSA-based Pattern over Boolean Data for an Improved WS-BPEL to Petri Net Mapping. In: Third Int. Conf. on Internet and Web Applications and Services, pp. 590–595. IEEE, Los Alamitos (2008)Google Scholar
  12. 12.
    Monakova, G., Kopp, O., Leymann, F.: Improving Control Flow Verification in a Business Process using an Extended Petri Net. In: 1st Central-European Workshop on Services and their Composition, vol. 438, 95–101. CEUR-WS.org (2009)Google Scholar
  13. 13.
    Kopp, O., Khalaf, R., Leymann, F.: Reaching Definition Analysis Respecting Dead Path Elimination Semantics in BPEL Processes. Report 2007/04, IAAS (2007)Google Scholar
  14. 14.
    Thakur, A., Govindarajan, R.: Comprehensive Path-sensitive Data-flow Analysis. In: 6th Int. Symp. on Code Generation and Optimization, pp. 55–63. ACM Press, New York (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Thomas S. Heinze
    • 1
  • Wolfram Amme
    • 1
  • Simon Moser
    • 2
  1. 1.Institute of Computer ScienceFriedrich Schiller University of JenaJenaGermany
  2. 2.IBM Software Laboratory BöblingenBusiness Process SolutionsBöblingenGermany

Personalised recommendations