- A Tool for Behaviour-Based Discovery of Approximately Matching Web Services
- Lecture Notes in Computer Science
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
We present a tool that is able to discover stateful Web Services in a database, and to rank the results according to a similarity score expressing the affinities between each of them and a user-submitted
query. To determine these affinities, we take behaviour into account, both of the user’s query and of the services. The names of service operations, their order of invocation, and their parameters may differ from those required by the actual user, which necessitates using similarity scores, and hence the notion of soft constraints. The final tool is based on Soft Constraint Automata and an approximate bisimulation among them, modeled and solved as a Constraint Optimisation Problem.
- go to publisher's site
- Proceedings title: Software engineering and formal methods: 11th International Conference, SEFM 2013, Madrid, Spain, September
25-27, 2013: proceedings
Place of publication: Heidelberg
Editors: R.M. Hierons, M.G. Merayo, M. Bravetti
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.