Service specification and matching based on graph transformation

@inproceedings{Heckel2004ServiceSA,
  title={Service specification and matching based on graph transformation},
  author={Reiko Heckel and Alexey Cherchago and Marc Lohmann},
  booktitle={Electr. Notes Theor. Comput. Sci.},
  year={2004}
}
When Web services are composed by linking service providers and requestors, the requestor's requirements for a "useful" service have to be matched against the service description offered by the provider. Among other things, service specifications (requirements or descriptions) may contain operation contracts specifying pre-conditions and effects of (required or provided) operations. In this paper we provide a semi-formal, UML-based notation for contracts and contract matching, as well as a… CONTINUE READING
BETA

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Graph Processes

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

J

R. Bardohl, H. Ehrig
  • de Lara, O. Runge, G. Taentzer, and I. Weinhold. Node type inheritance concepts for typed graph transformation. Fachberichte Informatik 2003-19, Technical University Berlin
  • 2003
VIEW 1 EXCERPT

Web Services Development and Deployment with WebSphere V5 Tools and Technologies Part 2: Publishing and Finding a Web Service in a UDDI Registry

G. Flurry
  • 2003

Simulation

S. Narayanan, S. A. McIlraith
  • verification and automated composition of web services. In Proceedings of the eleventh international conference on World Wide Web, pages 77–88, Honolulu, Hawaii
  • 2002
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…