Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
Web Services Composition with Traceability Centered on Dependency
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
Challenges and techniques on the road to dynamically compose web services
ICWE '06 Proceedings of the 6th international conference on Web engineering
Semantic Web Service Composition Based on a Closed World Assumption
ECOWS '06 Proceedings of the European Conference on Web Services
A refined service relationships graph generation algorithm for web services composition
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Revealing hidden relations among web services using business process knowledge
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
| Hi-index | 0.00 |
Composition of web services has received increased interest with emerging application development architecture-Service Oriented Architecture (SOA). Doing composition (semi-) automatically is a crucial aspect in overcoming runtime problems that arise due to dynamic nature of runtime environment. In SOA, applications are created as combinations of independently developed Web services. This leads to emergence of different dependencies among the component services forming the composite service. Given a set of candidate web services and a user's request description in terms of (I,O,P,E,G), the proposed method can find a composite service that would satisfy user's requirements in two steps. First, it anticipates the potential direct and indirect dependency between abstract services, and second, it generates process model (PM) automatically using the dependency information. The architecture and application of this method and its application are discussed using a case study. Moreover, a summary of existing techniques and their shortcomings are presented. This approach takes advantages of a sorting algorithm and semantic I/O matching techniques.