Web Services, European Conference on (2010)
Ayia Napa, Cyprus
Dec. 1, 2010 to Dec. 3, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ECOWS.2010.15
Many approaches to the Web service composition problem benefit from their use of formal methods to guarantee the correctness of the composite services that they produce, but these approaches often require the functionality of the composite service to be specified using one particular formalism (e.g., goal graphs, temporal logic, pre-/post-conditions). As a result, each of these existing approaches falls short in realizing a composite service when the required functionality cannot be fully expressed in the supported formalism. To overcome this problem, we propose a new formal meta-framework that (a) is capable of reusing any existing formalisms and (b) allows the use of functional requirements that are currently not expressible in any one formalism. Our technique assumes that any functional requirement can be decomposed and expressed as a boolean combination of "atomic" requirements, which are representable in at least one existing formalism. Based on this assumption, we use existing methods to identify sets of Web services that conform to the atomic requirements. Our meta-framework then identifies compositions that conform to the overall functional requirement by (a) employing satisfiability techniques to prune the (exponentially large) space of possible compositions and (b) building workable compositions from satisfiable sets of services. As a result, our meta-framework allows for easy and effective memorization of prior composition results, thereby enhancing the efficiency of generating new compositions.
service composition, requirement decomposition, formal methods
Ganesh Ram Santhanam, Samik Basu, Zachary J. Oster, "Decomposing the Service Composition Problem", Web Services, European Conference on, vol. 00, no. , pp. 163-170, 2010, doi:10.1109/ECOWS.2010.15