Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint relaxation may be perfect
Artificial Intelligence
A calculus of mobile processes, II
Information and Computation
Information and Computation
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Priority in process algebras
Semirings in operations research and computer science: more algebra
Fundamenta Informaticae
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
Theoretical Computer Science - Mathematical foundations of computer science 2000
Constraint-Based Policy Negotiation and Enforcement for Telco Services
TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
QoS-Aware Service Composition in Dino
ECOWS '07 Proceedings of the Fifth European Conference on Web Services
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation
Electronic Notes in Theoretical Computer Science (ENTCS)
Structured Communications with Concurrent Constraints
Trustworthy Global Computing
Enhancing constraints manipulation in semiring-based formalisms
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
A core calculus for a comparative analysis of bio-inspired calculi
ESOP'07 Proceedings of the 16th European conference on Programming
A fuzzy approach for negotiating quality of services
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Open bisimulation for the concurrent constraint pi-calculus
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
A concurrent constraint and pi-calculus-based language for service contracting
International Journal of Wireless and Mobile Computing
| Hi-index | 0.00 |
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.