The paper represents current achievements of an ongoing research that aims to develop a formal approach supporting an automatic selection of a Web service sought by a requestor. The approach is based on the matching the requestor’s requirements for a "useful" service against the service description offered by the provider. We focus on the checking behavioral compatibility between operation contracts specifying pre-conditions and effects of required and provided operations. Graph transformation rules with positive application conditions are proposed as a visual formal notation for contracts. The desired dependence between requestor and provider contracts is determined by the semantic compatibility relation and syntactic matching procedure that is sound w.r.t. this relation.
@InProceedings{heckel_et_al:DagSemProc.04101.6, author = {Heckel, Reiko and Cherchago, Alexey}, title = {{Application of Graph Transformation for Automating Web Service Discovery}}, booktitle = {Language Engineering for Model-Driven Software Development}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4101}, editor = {Jean Bezivin and Reiko Heckel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.6}, URN = {urn:nbn:de:0030-drops-121}, doi = {10.4230/DagSemProc.04101.6}, annote = {Keywords: SOA , graph transformation , contracts} }
Feedback for Dagstuhl Publishing