×

Structural and behavioural compatibility of graphical service specifications. (English) Zbl 1178.68033

Summary: 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.

MSC:

68M10 Network design and communication in computer systems
68R10 Graph theory (including graph drawing) in computer science

Software:

Eiffel
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Fensel, D.; Bussler, C., The web service modeling framework WSFM, Electron. Commerce Res. Appl., 1, 2, 113-137 (2002)
[2] Cherchago, A.; Heckel, R., Specification matching of web services using conditional graph transformation rules, (Ehrig, H.; Engels, G.; Parisi-Presicce, F.; Rozenberg, G., Proc. 2nd Int. Conference on Graph Transformation (ICGT’04), Rome, Italy. Proc. 2nd Int. Conference on Graph Transformation (ICGT’04), Rome, Italy, LNCS, vol. 3256 (2004), Springer-Verlag), 304-318 · Zbl 1116.68550
[5] Ehrig, H.; Pfender, M.; Schneider, H., Graph grammars: an algebraic approach, (14th Annual IEEE Symposium on Switching and Automata Theory (1973), IEEE), 167-180
[7] Habel, A.; Heckel, R.; Taentzer, G., Graph grammars with negative application conditions, Fund. Inform., 26, 3,4, 287-313 (1996) · Zbl 0854.68055
[8] Ehrig, H.; Mahr, B., Fundamentals of Algebraic Specification 2: Module Specifications and Constraints (1990), Springer-Verlag · Zbl 0759.68013
[10] Alonso, G.; Casati, F.; Kuno, H.; Machiraju, V., Web Services: Concepts, Architectures and Applications (2004), Springer-Verlag · Zbl 1029.68007
[11] Meyer, B., Object-Oriented Software Construction (1997), Prentice-Hall · Zbl 0987.68516
[12] Fensel, D., Ontologies: Silver Bullet for Knowledge Management and Electronic Commerce (2001), Springer-Verlag · Zbl 0971.68154
[13] Pahl, C., An ontology for software component matching, (Pezze, M., Fundamental Approaches to Software Engineering: 6th International Conference, FASE 2003. Fundamental Approaches to Software Engineering: 6th International Conference, FASE 2003, LNCS, vol. 2621 (2003), Springer), 6-21 · Zbl 1032.68580
[15] Corradini, A.; Montanari, U.; Rossi, F., Graph processes, Fund. Inform., 26, 3,4, 241-266 (1996) · Zbl 0854.68054
[16] Corradini, A.; Montanari, U.; Rossi, F.; Ehrig, H.; Heckel, R.; Löwe, M., Algebraic approaches to graph transformation, Part I: Basic concepts and double pushout approach, (Rozenberg, G., Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations (1997), World Scientific), 163-245, preprint available as Tech. Rep. 96/17, Univ. of Pisa
[17] Ehrig, H., Introduction to the algebraic theory of graph grammars, (Claus, V.; Ehrig, H.; Rozenberg, G., Proc. 1st Graph Grammar Workshop. Proc. 1st Graph Grammar Workshop, LNCS, vol. 73 (1979), Springer-Verlag), 1-69
[18] Grosse-Rhode, M.; Parisi-Presicce, F.; Simeoni, M., Refinements and modules for typed graph transformation systems, (Fiadeiro, J., Proc. Workshop on Algebraic Development Techniques (WADT’98), at ETAPS’98, Lisbon, April 1998. Proc. Workshop on Algebraic Development Techniques (WADT’98), at ETAPS’98, Lisbon, April 1998, LNCS, vol. 1589 (1999), Springer-Verlag), 138-151 · Zbl 0961.68034
[19] Zaremski, A.; Wing, J., Signature matching: a tool for using software libraries, ACM Transactions on Software Engineering and Methodology (TOSEM), 4, 2, 146-170 (1995)
[22] Bracciali, A.; Brogi, A.; Canal, C., A formal approach to component adaptation, J. Syst. Softw., 74, 1, 45-54 (2005)
[26] Taentzer, G.; Rensink, A., Ensuring structural constraints in graph-based models with type inheritance, (Cerioli, M., FASE’05. FASE’05, Lecture Notes in Computer Science, vol. 3442 (2005), Springer), 64-79 · Zbl 1119.68365
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.