Article

A Framework for Linking and Pricing No-Cure-No-Pay Services.

Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands; Institut für Informatik Unter den Linden 6, Humboldt-Universität zu Berlin, 10099, Berlin, Germany
T. Petri Nets and Other Models of Concurrency 01/2009; 2:192-207. DOI: 10.1007/978-3-642-00899-3_11
Source: DBLP

ABSTRACT In this paper, we present a framework that allows us to orchestrate web services such that the web services involved in this orchestration interact properly. To achieve this, we predefine service interfaces and certain routing constructs. Furthermore, we define a number of rules to incrementally compute the price of such a properly interacting orchestration (i.e. a web service) from the price of its web services. The fact that a web service gets only payed after its service is delivered (no-cure-no-pay) is reflected by considering a probability of success. To determine a safe price that includes the risk a web service takes, we consider the variance of costs.

0 Bookmarks
 · 
109 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In the world of Service Oriented Architectures, one deals with networks of cooperating components. A component offers services; to deliver a service it possibly needs services of other components, thus forming a service tree. This tree is built dynamically and not known beforehand. It is hard to verify the behavior of a service tree by using standard verification techniques, because these techniques typically assume a static flattened model. In this paper we model a component by an open Petri net. We give a sufficient condition for proper completion (called soundness) that requires only pairwise checks of the service compositions. We also provide a correctness-by-construction approach for building services trees.
    06/2009: pages 283-302;

Full-text (3 Sources)

View
30 Downloads
Available from
Jun 2, 2014