Web service-based business process automation using matching algorithms

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we focus on two problems of the Web service-based business process integration: the discovery of Web services based on the capabilities and properties of published services, and the composition of business processes based on the business requirements of submitted requests. We propose a solution to these problems, which comprises multiple matching algorithms, a micro-level matching algorithm and macro-level matching algorithms. The solution from the macro-level matching algorithms is optimal in terms of meeting a certain business objective, e.g., minimizing the cost or execution time, or maximizing the total utility value of business properties of interest. Furthermore, we show how existing Web service standards, UDDI and BPEL4WS, can be used and extended to specify the capabilities of services and the business requirements of requests, respectively.

Cite

CITATION STYLE

APA

Kim, Y., & Lee, J. (2006). Web service-based business process automation using matching algorithms. In IFIP Advances in Information and Communication Technology (Vol. 218, pp. 131–140). Springer New York LLC. https://doi.org/10.1007/978-0-387-34749-3_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free