Nothing Special   »   [go: up one dir, main page]

Skip to main content

Comparing Two Approaches to Compensable Flow Composition

  • Conference paper
CONCUR 2005 – Concurrency Theory (CONCUR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3653))

Included in the following conference series:

Abstract

Web services composition is an emerging paradigm for the integration of long running business processes, attracting the interest of both Industry, in terms of XML-based standards for business description, and Academy, exploiting process description languages. The key challenging aspects to model are orchestration workflows, choreography of exchanged messages, fault handling, and transactional integrity with compensation mechanisms. Few recent proposals attempted to mitigate the explosion of XML-constructs in ad hoc standards by a careful selection of a small set of primitives related to the above aspects. This papers clarifies analogies and differences between two such recent process description languages: one based on interleaving trace semantics and the other on concurrent traces. We take advantage of their comparison to characterise and relate four different coordination policies for compensating parallel processes. Such policies differ on the way in which the abort of a process influences the execution of sibling processes, and whether compensation is distributed or centralised.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bocchi, L., Laneve, C., Zavattaro, G.: A calculus for long-running transactions. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 124–138. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. BPEL Specification (v.1.1), http://www.ibm.com/developerworks/library/ws-bpel

  3. Business Process Modeling Language (BPML), http://www.bpmi.org/BPML.htm

  4. Bruni, R., Melgratti, H., Montanari, U.: Nested commits for mobile calculi: extending Join. In: Lévy, J.-J., Mayr, E., Mitchell, J. (eds.) Proceedings of the 3rd IFIP-TCS 2004, 3rd IFIP Intl. Conference on Theoretical Computer Science, pp. 569–582. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  5. Bruni, R., Melgratti, H., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: Proceedings of POPL 2005, 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 209–220. ACM Press, New York (2005)

    Chapter  Google Scholar 

  6. Butler, M., Ferreira, C.: An operational semantics for StAC, a language for modeling long-running business transactions. In: De Nicola, R., Ferrari, G., Meredith, G. (eds.) COORDINATION 2004. LNCS, vol. 2949, pp. 87–104. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Butler, M., Hoare, T., Ferreira, C.: A trace semantics for long-running transactions. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol. 3525, pp. 133–150. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Garcia-Molina, H., Salem, K.: Sagas. In: Dayal, U., Traiger, I.L. (eds.) Proceedings of the ACM Special Interest Group on Management of Data Annual Conference, pp. 249–259. ACM Press, New York (1987)

    Google Scholar 

  9. Laneve, C., Zavattaro, G.: Foundations of web transactions. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 282–298. Springer, Heidelberg (2005)

    Google Scholar 

  10. Leymann. F.: WSFL Specification (v.1.0) (May 2001), http://www-306.ibm.com/software/solutions/webservices/pdf/WSFL.pdf

  11. Mazzara, M., Lucchi, R.: A framework for generic error handling in business processes. In: Bravetti, M., Zavattaro, G. (eds.) Proceedings of WS-FM 2004, 1st International Workshop on Web Services and Formal Methods (2004) (to appear as ENTCS)

    Google Scholar 

  12. Melgratti, H.: Models and Languages for Global Computing Transaction. PhD thesis, Computer Science Department, University of Pisa (2005) (Submitted)

    Google Scholar 

  13. Web Service Choreography Interface (WSCI) 1.0, http://www.w3.org/TR/wsci

  14. Web Services Conversation Language (WSCL) 1.0, http://www.w3.org/TR/wscl10/

  15. Web Service Description Language (WSDL), http://www.w3.org/TR/wsdl

  16. Web Services for Business Process Design (XLANG), http://www.gotdotnet.com/team/xmlwsspecs/xlang-c/default.htm

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruni, R., Butler, M., Ferreira, C., Hoare, T., Melgratti, H., Montanari, U. (2005). Comparing Two Approaches to Compensable Flow Composition. In: Abadi, M., de Alfaro, L. (eds) CONCUR 2005 – Concurrency Theory. CONCUR 2005. Lecture Notes in Computer Science, vol 3653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539452_30

Download citation

  • DOI: https://doi.org/10.1007/11539452_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28309-6

  • Online ISBN: 978-3-540-31934-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics