Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/1828
Title: Structural and behavioural compatibility of graphical service specifications
Authors: Heckel, Reiko
Cherchago, A.
First Published: 2007
Citation: Journal of Logic and Algebraic Programming, 2007, 70 (1), pp.15-33
Abstract: The ability of applications to dynamically discover required services is a key motivation for Web Services. However, this aspect is not entirely supported by current Web Services standards. It is our objective to develop a formal approach, allowing the automation of the discovery process. The approach is based on the matching of interface specifications of the required and provided services. In the present paper, we establish an integral notion of structural and behavioural compatibility of service specifications. While structural information is represented by operation declarations, behavioural descriptions are provided by contracts expressed as graph transformation rules with positive and negative application conditions. The integration of structural and behavioural descriptions is facilitated by typed and parameterised graph transformation systems, augmenting the rule-based description of behaviour by a type graph and operation declarations representing the structural aspect. The matching relation taking into account this combination is called parameterised substitution morphism. We show that substitution morphisms satisfy the semantic requirement inherent in its name: the substitutability of abstract operations by (calls to) concrete ones.
DOI Link: 10.1016/j.jlap.2006.05.003
ISSN: 1567-8326
Links: http://www.sciencedirect.com/science/article/pii/S1567832606000282
http://hdl.handle.net/2381/1828
Type: Article
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.