Transactional Service Level Agreement

  • Maria Grazia Buscemi
  • Hernán Melgratti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4912)


Several models based on process calculi have addressed the definition of linguistic primitives for handling long running transactions and Service Level Agreement (SLA) in service oriented applications. Nevertheless, the approaches appeared in the literature deal with these aspects as independent features. We claim that transactional mechanisms are relevant for programming multi-step SLA negotiations and, hence, it is worth investigating the interplay among such formal approaches. In this paper we propose a process calculus, the committed cc-pi, that combines two proposals: (i) cc-pi calculus accounting for SLA negotiation and (ii) cJoin as a model of long running transactions. We provide both a small- and a big-step operational semantics of committed cc-pi as labelled transition systems, and we prove a correspondence result.


Stable Process Service Level Agreement Parallel Composition Label Transition System Process Calculus 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Acciai, L., Boreale, M., dal Zilio, S.: A concurrent calculus with atomic transactions. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Bacciu, D., Botta, A., Melgratti, H.: A fuzzy approach for negotiating quality of services. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2007. LNCS, vol. 4661, Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2), 201–236 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Bruni, R., Melgratti, H., Montanari, U.: Nested commits for mobile calculi: extending Join. In: Proc. of the 3rd IFIP-TCS 2004, 3rd IFIP Intl. Conference on Theoretical Computer Science, pp. 569–582. Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
  6. 6.
    Bruni, R., Melgratti, H., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: POPL 2005: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 209–220. ACM Press, New York (2005)CrossRefGoogle Scholar
  7. 7.
    Buscemi, M.G., Montanari, U.: Cc-pi: A constraint-based language for specifying service level agreements. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the Join calculus. In: Proc. of 23rd Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL 1996), pp. 372–385. ACM Press, New York (1996)CrossRefGoogle Scholar
  10. 10.
    Keller, A., Ludwig, H.: The WSLA framework: Specifying and monitoring service level agreements for web services. Jour. Net. and Sys. Manag. 11(1), 57–81 (2003)CrossRefGoogle Scholar
  11. 11.
    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
  12. 12.
    Milner, R., Parrow, J., Walker, J.: A calculus of mobile processes, I and II. Inform. and Comput. 100(1), 1–77 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Saraswat, V., Rinard, M.: Concurrent constraint programming. In: Proc. of the 17th Symposium on Principles of programming languages (POPL 1990), ACM Press, New York (1990)Google Scholar
  14. 14.
    Skene, J., Lamanna, D., Emmerich, W.: Precise service level agreements. In: Proc. of the 26th International Conference on Software Engineering (ICSE 2004) (2004)Google Scholar
  15. 15.
    Wischik, L., Gardner, P.: Explicit fusions. Theoret. Comput. Sci. 340(3), 606–630 (2005)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Maria Grazia Buscemi
    • 1
  • Hernán Melgratti
    • 1
  1. 1.IMTLucca Institute for Advanced StudiesItaly

Personalised recommendations