Coupled Signature and Specification Matching for Automatic Service Binding

摘要: Matching of semantic service descriptions is the key to automatic discovery and binding. Existing approaches split matchmaking process in two step: signature specification matching. However, this leads problem that offers are not found although they functionally suitable if their fitting requested one. Therefore, paper, we propose a matching algorithm does use separated explicit step, but derives necessary messages from comparison pre- postconditions. As result, only finds all services even signatures do match, also able derive needed for an invocation.