Matching algorithms for composing business process solutions with web services

15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The automation of process integration with Web service technologies requires the automation of discovery and composition of Web services. This paper addresses these two problems in 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. The proposed solution comprises multiple matching algorithms, a micro-level matching algorithm, which matches the capabilities of services with activities in a process request, and macro-level matching algorithms, which are used to compose a business process by identifying services that satisfy the business requirements and constraints of the request. 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.

Cite

CITATION STYLE

APA

Lee, J. (2003). Matching algorithms for composing business process solutions with web services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2738, pp. 393–402). Springer Verlag. https://doi.org/10.1007/978-3-540-45229-4_38

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