Please use this identifier to cite or link to this item:
|Title:||Process matching: A structural approach for business process search|
Web service process modeling
|Citation:||Zhu, J., Pung, H.K. (2009). Process matching: A structural approach for business process search. Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009 : 227-232. ScholarBank@NUS Repository. https://doi.org/10.1109/ComputationWorld.2009.61|
|Abstract:||The evaluation of "closeness" between services is always crucial in the process of Web service integration and reuse. However, matching services solely based on their inputs/outputs is insufficient for developers to understand their behavioral properties or other constraints. To go beyond this limitation, services should be matched and integrated at the process level. But existing approaches for business process matching mostly deploy symmetric measure which hardly reflect the perceptions of the requestor, i.e. some behaviors of the process may be highly desirable. To address these issues, this paper presents a structural approach to model Web service processes, and proposes an asymmetric way of computing process similarity based on edit distance. Process structure weights may be specified and contribute to the similarity value. In addition, to ensure a scalable and efficient search, two indexing schemes for the process model are developed. © 2009 IEEE.|
|Source Title:||Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 19, 2018
WEB OF SCIENCETM
checked on Jul 3, 2018
checked on May 26, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.