Advertisement

Process Restructuring in the Presence of Message-Dependent Variables

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

Abstract

When services interact, issues can be caused by service implementations being stateful because a stateful implementation requires a certain message exchange protocol to be followed. At present, a model of such a message exchange protocol is seldom complete and precise, mainly because the available analysis techniques for its derivation suffer from drawbacks: most prominently the neglect of data. Process restructuring allows for the increase of precision of such a data-unaware analysis by resolving conditional into unconditional control flow in service implementations and hence eliminating the need to consider data. But the restructuring approach so far has been restricted to cases where conditions of data-based choices have been defined over quasi-constant variables only. In this paper we introduce a restructuring technique that also allows us to resolve data-based choices with conditions over variables whose value is determined by the contents of incoming messages.

Keywords

Business Process Incoming Message Conditional Control Loop Condition Service Implementation 
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., Hirnschall, A., Verbeek, H.M.W.: 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
  2. 2.
    Business Process Model and Notation (BPMN) Version 2.0. OMG Standard, Object Management Group/Business Process Management Initiative (2009)Google Scholar
  3. 3.
    Flanagan, C., Qadeer, S.: Predicate Abstraction for Software Verification. ACM SIGPLAN Notices 37(1), 191–202 (2002)CrossRefzbMATHGoogle Scholar
  4. 4.
    Graf, S., Saidi, H.: Construction of Abstract State Graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  5. 5.
    Heinze, T.S., Amme, W., Moser, S.: A Restructuring Method for WS-BPEL Business Processes Based on Extended Workflow Graphs. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 211–228. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Lohmann, N.: A Feature-Complete Petri Net Semantics for WS-BPEL 2.0. In: Dumas, M., Heckel, R. (eds.) WS-FM 2007. LNCS, vol. 4937, pp. 77–91. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Lohmann, N., Massuthe, P., Wolf, K.: Operating Guidelines for Finite-State Services. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 321–341. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    Sidorova, N., Stahl, C., Trčka, N.: Workflow Soundness Revisited: Checking Correctness in the Presence of Data While Staying Conceptual. In: Pernici, B. (ed.) CAiSE 2010. LNCS, vol. 6051, pp. 530–544. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  9. 9.
    Vanhatalo, J., Völzer, H., Koehler, J.: The refined process structure tree. Data & Knowledge Engineering 68(9), 793–818 (2009)CrossRefGoogle Scholar
  10. 10.
    Vanhatalo, J., Völzer, H., Leymann, F., Moser, S.: Automatic Workflow Graph Refactoring and Completion. In: Bouguettaya, A., Krueger, I., Margaria, T. (eds.) ICSOC 2008. LNCS, vol. 5364, pp. 100–115. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  11. 11.
    Web Services Business Process Execution Language Version 2.0. OASIS Standard, Organization for the Advancement of Structured Information Standards (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thomas S. Heinze
    • 1
  • Wolfram Amme
    • 1
  • Simon Moser
    • 2
  1. 1.Friedrich Schiller University of JenaJenaGermany
  2. 2.IBM Software Laboratory BöblingenBöblingenGermany

Personalised recommendations