A Logical Way to Negotiate Services
Abstract: Service providers commonly provide only a fixed catalog of services to their clients. Both clients and service providers can benefit from service negotiation, in which a client makes a query for a specific service, and the provider counters with an offer. The query could include parameters that control the performance, reliability, and function of the service. However, a problem with service negotiation is that it can be expensive for a service provider to support. In this paper we define a formal negotiation policy language that enables automated service negotiation. In the model supported by the language, service providers can recursively obtain the services they need from sub-providers. The queries made by clients, and the offers returned from service providers, are expressed in quantifier-free first-order logic. Quantifier elimination is used to transform constraints between providers and sub-providers. The pattern of interaction between clients and service providers is defined in process algebra. We show a correctness property of our language: if sub-providers respond positively to queries, then so does the provider itself.
- Declarative composition and peer-to-peer provisioning of dynamic web services. In Data Engineering, 2002. Proceedings. 18th International Conference on, pages 297–308. IEEE, 2002.
- A hierarchical approach to service negotiation. In Proceedings of IEEE International Conference on Web Services. IEEE, 2011.
- SNAP: A protocol for negotiating service level agreements and coordinating resource management in distributed systems. In 8th Workshop on Job Scheduling Strategies for Parallel Processing, pages 153–183, 2002.
- Super-exponential complexity of Presburger arithmetic. Symp. Appl. Math, volume VII of SIAM-AMS Proc., pp. 27-41, 1974.
- PANDA: Specifying policies for automated negotiations of service contracts. ICSOC 2003, pages 287–302, 2003.
- Quality-aware service delegation in automated web service composition: An automata-theoretic approach. Journal of Automata, Languages, and Combinatorics, 11(2):169, 2006.
- A framework for automated negotiation of service level agreements in services grids. In Business Process Management Workshops, pages 89–101. Springer, 2006.
- Robin Milner. Communication and concurrency. Prentice Hall, 1989.
- M. Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt. 1930.
- M. Presburger and D. Jabcquette. On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation. History and Philosophy of Logic, 12(2):225–233, 1991. English translation of [9].
- A. Schrijver. Theory of linear and integer programming. John Wiley & Sons Inc, 1998.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.