License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-121
URL: http://drops.dagstuhl.de/opus/volltexte/2005/12/
Go to the corresponding Portal


Heckel, Reiko ; Cherchago, Alexey

Application of Graph Transformation for Automating Web Service Discovery

pdf-format:
Document 1.pdf (274 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{heckel_et_al:DSP:2005:12,
  author =	{Reiko Heckel and Alexey Cherchago},
  title =	{Application of Graph Transformation for Automating Web Service Discovery},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  year =	{2005},
  editor =	{Jean Bezivin and Reiko Heckel},
  number =	{04101},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/12},
  annote =	{Keywords: SOA , graph transformation , contracts}
}

Keywords: SOA , graph transformation , contracts
Seminar: 04101 - Language Engineering for Model-Driven Software Development
Issue Date: 2005
Date of publication: 02.02.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI