Software Engineering for Service-Oriented Overlay Computers Software Engineering for Service-Oriented Overlay Computers
 Copyright Information The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder. show all publications Sensoria Bibliography Site QoS Negotiation in Service Composition Maria Grazia Buscemi, Ugo Montanari abstract: Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Service (QoS) plays a key role in service composition as services providing the same functionalities can be differentiated according to their QoS guarantees. At subscription time, a service requester and a provider may sign a contract recording the QoS of the supplied service. The cc-pi calculus has been introduced as a constraint-based model of QoS contracts. In this work we propose a variant of the cc-pi calculus in which the alternatives in a choice rather than being selected non-deterministically have a dynamic priority. Basically, a guard $c_j:\pi_j$ in a choice is enabled if the constraint $c_j$ is entailed by the store of constraints and the prefix $\pi_j$ can be consumed. Moreover, the $j$-th branch can be selected not only if the corresponding guard $c_j:\pi_j$ is enabled but also if $c_j$ is weaker than the constraints $c_i$ of the other enabled alternatives. We prove that our choice operator is more general than a choice operator with static priority. Finally, we exploit some examples to show that our prioritised calculus allows arbitrarily complex QoS negotiations and that a static form of priority is stricly less expressive than ours.