A Formal Approach to Service Specification and Matching based on Graph Transformation

Authors:
R. Heckel;A. Cherchago;M. Lohmann
Affiliations:
Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, Germany;Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, Germany;Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2004

Citing 7
Cited 1

Graph processes

Fundamenta Informaticae - Special issue on graph transformations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach

Handbook of graph grammars and computing by graph transformation
Simulation, verification and automated composition of web services

Proceedings of the 11th international conference on World Wide Web
Confluence of Typed Attributed Graph Transformation Systems

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Signature and specification matching

Signature and specification matching
Graph-grammars: An algebraic approach

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
An ontology for software component matching

FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering

Describing dynamic software architectures using an extended UML model

Proceedings of the 2006 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 formalization of these notions in terms of graph transformation. We establish the desired semantic relation between requestor and provider specifications and prove the soundness of our syntactic notion of matching w.r.t. this relation.