Logo eprints

Service discovery and negotiation with COWS

Lapadula, Alessandro and Pugliese, Rosario and Tiezzi, Francesco Service discovery and negotiation with COWS. Electronic Notes in Theoretical Computer Science, 200 (3). pp. 133-154. ISSN 1571-0661 (2008)

[img]
Preview
PDF - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (330kB) | Preview
[img]
Preview
PDF - Accepted Version
Download (291kB) | Preview

Abstract

To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider.

Item Type: Article
Identification Number: 10.1016/j.entcs.2008.04.097
Additional Information: Proceedings of the 3rd International Workshop on Automated Specification and Verification of Web Systems (WWV 2007).
Funders: This work has been supported by the EU project SENSORIA, IST-2 005-016004.
Uncontrolled Keywords: Service discovery; negotiation; service level agreement; service orchestration; process calculi
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Users 31 not found.
Date Deposited: 14 Jun 2011 15:00
Last Modified: 08 Oct 2014 09:29
URI: http://eprints.imtlucca.it/id/eprint/414

Actions (login required)

Edit Item Edit Item