Buscemi, Maria Grazia and Melgratti, Hernán C. Transactional Service Level Agreement. In: Post-proceedings of the 3rd Symposium on Trustworthy Global Computing (TGC’07). Lecture Notes in Computer Science, 4912 . Springer, pp. 124-139. ISBN 978-3-540-78662-7 (2008)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Additional Information:||The final publication is available at www.springerlink.com.|
|Funders:||Research supported by the FET-GC II Project IST-2005-16004 Sensoria and by the Italian FIRB Project Tocai.It.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 29 not found.|
|Date Deposited:||02 Mar 2011 14:55|
|Last Modified:||11 Jul 2011 14:33|
Actions (login required)