Navigation
A Case for Evidence-Aware Distributed Reputation Systems – Overcoming the Limitations of Plausibilit
Activity-Based User Modeling in Service-Oriented Ad-hoc-Networks
Combining Query and Preference – An Approach to Fully Automatize Dynamic Service Binding
Comparison of Overlay Mechanisms for Service Trading in Ad hoc Networks
Coupled Signature and Specification Matching for Automatic Service Binding
Effective and Efficient Search for Services in Ad-hoc-Networks
Engineering Incentive Schemes for Ad Hoc Networks – A Case Study for the Lanes Overlay.
Handbuch zur DIANE Service Description
How Social Structure Improves Distributed Reputation Systems – Three Hypotheses
Integrating Preferences into Service Requests to Automate Service Usage
On User Support by Using Network Services
Position Paper for the First AKT Workshop on Semantic Web Services
RDF-Technologies to Provide Mobile Users with Services in Wireless Networks
The Buddy System – A Distributed Reputation System Based On Social Structure.
User Support for Formulating Complex Service Requests
Coupled Signature and Specification Matching for Automatic Service Binding
Title: | Coupled Signature and Specification Matching for Automatic Service Binding |
---|---|
Authors: | Michael Klein, Birgitta König-Ries |
Source: | European Conference on Web Services (ECOWS 2004), 27.-30. September 2004 |
Place: | Erfurt, Germany |
Date: | 2004-09-01 |
Type: | Publication |
File: | ECOWS2004.pdf |
Slides: | ECOWS2004.ppt |
BibTex: |
@INPROCEEDINGS{KK04c, author = {Michael Klein and Birgitta K{"o}nig-Ries}, month = {September}, year = 2004, title = {Coupled Signature and Specification Matching for Automatic Service Binding}, booktitle = {Proc. of the European Conference on Web Services (ECOWS 2004)}, address = {Erfurt, Germany}, abstract = {Matching of semantic service descriptions is the key to automatic service discovery and binding. Existing approaches split the matchmaking process in two step: signature and specification matching. However, this leads to the problem that offers are not found although they are functionally suitable if their signature is not fitting the requested one. Therefore, in this paper, we propose a matching algorithm that does not use a separated and explicit signature matching step, but derives the necessary messages from the comparison of pre- and postconditions. As a result, the algorithm not only finds all functionally suitable services even if their signatures do not match, but also is able to derive the messages needed for an automatic invocation.} } |