CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements. Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Service (cost, performance, availability, etc.). In this work we propose a simple model of contracts for QoS and SLAs that also allows to study mechanisms for resource allocation and for joining different SLA requirements. Our language combines two basic programming paradigms: name-passing calculi and concurrent constraint programming (cc programming). Specifically, we extend cc programming by adding synchronous communication and by providing a treatment of names in terms of restriction and structural axioms closer to nominal calculi than to variables with existential quantification. In the resulting framework, SLA requirements are constraints that can be generated either by a single party or by the synchronisation of two agents. Moreover, restricting the scope of names allows for local stores of constraints, which may become global as a consequence of synchronisations. Our approach relies on a system of named constraints that equip classical constraints with a suitable algebraic structure providing a richer mechanism of constraint combination. We give reduction-preserving translations of both cc programming and the calculus of explicit fusions.

References in zbMATH (referenced in 19 articles )

Showing results 1 to 19 of 19.
Sorted by year (citations)

  1. Bengtson, Jesper; Parrow, Joachim; Weber, Tjark: Psi-calculi in Isabelle (2016)
  2. Normann, Håkon; Johansen, Christian; Hildebrandt, Thomas: Declarative event based models of concurrency and refinement in psi-calculi (2016)
  3. Benveniste, Albert; Jard, Claude; Abbes, Samy: Application of branching cells to QoS aware service orchestrations (2014)
  4. Benveniste, Albert; Jard, Claude; Kattepur, Ajay; Rosario, Sidney; Thywissen, John A.: QoS-aware management of monotonic service orchestrations (2014)
  5. Olarte, Carlos; Nigam, Vivek; Pimentel, Elaine: Dynamic spaces in concurrent constraint programming (2014)
  6. Olarte, Carlos; Rueda, Camilo; Valencia, Frank D.: Models and emerging trends of concurrent constraint programming (2013)
  7. Bonchi, Filippo; Buscemi, Maria Grazia; Ciancia, Vincenzo; Gadducci, Fabio: A presheaf environment for the explicit fusion calculus (2012)
  8. Pugliese, Rosario; Tiezzi, Francesco: A calculus for orchestration of web services (2012)
  9. Bengtson, Jesper; Johansson, Magnus; Parrow, Joachim; Victor, Björn: Psi-calculi: a framework for mobile processes with nominal data and logic (2011)
  10. Bonchi, Filippo; Montanari, Ugo: Symbolic and asynchronous semantics via normalized coalgebras (2011)
  11. Buscemi, Maria Grazia; Montanari, Ugo: QoS negotiation in service composition (2011)
  12. Fiadeiro, José Luiz; Lopes, Antónia; Bocchi, Laura: An abstract model of service discovery and binding (2011)
  13. Bocchi, Laura; Gorton, Stephen; Reiff-Marganiec, Stephan: From StPowla processes to SRML models (2010)
  14. Ciancia, Vincenzo; Kurz, Alexander; Montanari, Ugo: Families of symmetries as efficient models of resource binding (2010)
  15. Bistarelli, Stefano; Santini, Francesco: A nonmonotonic soft concurrent constraint language for SLA negotiation (2009)
  16. Bruni, Roberto; Lanese, Ivan: Parametric synchronizations in mobile nominal calculi (2008)
  17. Buscemi, Maria Grazia; Montanari, Ugo: A survey of constraint-based programming paradigms (2008)
  18. Lapadula, Alessandro; Pugliese, Rosario; Tiezzi, Francesco: Service discovery and negotiation with COWS. (2008)
  19. Miculan, Marino: A categorical model of the fusion calculus. (2008)