Specification matching of software components
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Autonomous Agents and Multi-Agent Systems
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Toward High-Precision Service Retrieval
IEEE Internet Computing
Synthesis of underspecified composite e-services based on automated reasoning
Proceedings of the 2nd international conference on Service oriented computing
Automated semantic web service discovery with OWLS-MX
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Similarity Based Semantic Web Service Match
WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
Backing composite web services using formal concept analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
| Hi-index | 0.00 |
Service matchmaking is the process of finding appropriate services for a given set of requirements. We present a novel service matchmaking approach based on the internal process of services. We model service internal processes using finite state machines and use various heuristics to find structural similarities between services. Further, we use a process ontology that captures the semantic relations between processes. This semantic information is then used to determine semantic similarities between processes and to compute match rates of services. We develop a case study to illustrate the benefits of using process-based matchmaking of services and to evaluate strengths of the different heuristics we propose.