Compositional Nested Long Running Transactions

  • Laura Bocchi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2984)


Web Services offer a widespread standard for making services available on the Internet. Of particular interest is the possibility of composing existing distributed services to create new complex ones. Existing research has already studied long running transactions within a formal context. In this other research, compensations are just partly compositional: a transaction’s failure triggers the compensation of immediately enclosed transactions, but not those of nested transactions. In this paper we formally model a more compositional protocol with the asynchronous pi calculus. The resulting behavior is similar to that of the Business Transaction Protocol of OASIS [1], which also has arbitrary nesting.


Formal Context Local Atomicity Nondeterministic Choice Nest Transaction Transaction Protocol 
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.


  1. 1.
    Dalal, S., Temel, S., Little, M., Potts, M., Webber, J.: Coordinating Business Transactions on the Web. IEEE Internet Computing (January-February 2003)Google Scholar
  2. 2.
    Dubray, J.J.: A novel approach for modeling business process definitions,
  3. 3.
    Thatte, S.: XLANG: Web Services for Business Process Design. Microsoft Corporation (2001),
  4. 4.
    Leymann, F.: Web Services Flow Language (WSFL 1.0). Member IBM Academy of Technology, IBM Software Group (2001),
  5. 5.
    Curbera, F., Goland, Y., Klein, J., Leymann, F., Roller, D., Thatte, S., Weerawarana, S.: Business Process Execution Language for Web Services (BPEL4WS 1.0) (2002),
  6. 6.
    W3C Choreography Group. Web Services Choreography Requirements 1.0. (2003),
  7. 7.
    Garcia-Molina, H., Salem, K.: Sagas. In: Proc. of SIGMOND International Conference on Management of Data, pp. 249–259 (1987)Google Scholar
  8. 8.
    Garcia-Molina, H., Gawlick, G., Klein, J., Kleissner, K., Salem, K.: Salem. Modelling Long Running Activities as Nested Sagas. IEEE Bulletin of Technical Committee on Data Engeneering 14(1) (1991)Google Scholar
  9. 9.
    Roberts, J., Srinivasan, K.: Tentative Hold Protocol Part 1: White paper. W3C Note 28 (November 2001),
  10. 10.
    Cabrera, F., Copeland, G., Cox, B., Freund, T., Klein, J., Storey, T., Thatte, S.: Web Services Transaction (WS-Transaction) (2002),
  11. 11.
    Bruni, R., Laneve, C., Montanari, U.: Orchestrating Transactions in Join Calculus. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 321–337. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Chrysantys, P.K., Ramamritham, K.: ACTA: a framework for specifying and reasoning about transaction structure and behavior. In: SIGMOND International Conference on Management of Data, pp. 194–203 (1990)Google Scholar
  14. 14.
    Lamport, L.: The Temporal Logic of Actions. ACM TOPLAS 16(3), 872–923 (1994)CrossRefGoogle Scholar
  15. 15.
    Milner, R.: Communicating and Mobile Systems: the Pi-calculus. Cambridge University Press, Cambridge (1999)zbMATHGoogle Scholar
  16. 16.
    Le Fessant, F., Maranget, L.: Compiling Join-Patterns. Electronic Notes in Theoretical Computer Science 16(3) (2000)Google Scholar
  17. 17.
    Berger, M., Honda, K.: The Two-Phase Commitment Protocol in an Extended Pi-calculus. Electronic Notes in Theoretical Computer Science 39(1) (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Laura Bocchi
    • 1
  1. 1.Dipartimento di Scienze dell’InformazioneUniversity of BolognaBolognaItaly

Personalised recommendations