CC-Pi: A Constraint Language for Service Negotiation and Composition

We overview the cc-pi calculus, a model for specifying QoS negotiations in service composition that also allows to study mechanisms for resource allocation and for joining different QoS parameters. Our language combines a synchronous channel-based communication mechanism with a set of primitives for constraint handling. We also illustrated a variant of the calculus in which the standard non-deterministic choice is replaced by a prioritised guarded choice that follows a static form of priority favouring its left over its right argument. We show how both versions of the calculus work by considering two case studies of the SENSORIA Project taken from the Telecommunication and Finance domains. Specifically, we apply the original cc-pi calculus for specifying Telco QoS policies and for enforcing them at execution time, and we formalise in the prioritised cc-pi a QoS-aware negotiation of a credit request service.

[1]  Glynn Winskel,et al.  CCS with Priority Choice , 1995, Inf. Comput..

[2]  Ugo Montanari,et al.  CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements , 2007, ESOP.

[3]  Marco Pistore,et al.  Structured coalgebras and minimal HD-automata for the pi-calculus , 2005, Theor. Comput. Sci..

[4]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[5]  Ugo Montanari,et al.  Open Bisimulation for the Concurrent Constraint Pi-Calculus , 2008, ESOP.

[6]  Philippa Gardner,et al.  Explicit fusions , 2000, Theor. Comput. Sci..

[7]  Stefano Bistarelli,et al.  A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation , 2009, VODCA@FOSAD.

[8]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[9]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[10]  Mariangiola Dezani-Ciancaglini,et al.  Structured Communications with Concurrent Constraints , 2008, TGC.

[11]  Davide Bacciu,et al.  A Fuzzy Approach for Negotiating Quality of Services , 2006, TGC.

[12]  David S. Rosenblum,et al.  QoS-Aware Service Composition in Dino , 2007, ECOWS 2007.

[13]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[14]  Sergiu Rudeanu,et al.  Semirings in Operations Research and Computer Science: More Algebra , 2004, Fundam. Informaticae.

[15]  Laura Ferrari,et al.  Constraint-Based Policy Negotiation and Enforcement for Telco Services , 2007, First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07).

[16]  Rance Cleaveland,et al.  Priority in Process Algebra , 2001, Handbook of Process Algebra.

[17]  Fabio Gadducci,et al.  Enhancing Constraints Manipulation in Semiring-Based Formalisms , 2006, ECAI.

[18]  Cristian Versari,et al.  A Core Calculus for a Comparative Analysis of Bio-inspired Calculi , 2007, ESOP.

[19]  Francesca Rossi,et al.  Constraint Relaxation may be Perfect , 1991, Artif. Intell..

[20]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.