Whether two web services are compatible depends not only on static properties like the correct typing of their message parameters, but also on their dynamic behaviour. Providing a simple description of the service behaviour based on process-algebraic or automata-based formalisms can help detecting many subtle incompatibilities in their interaction. Moreover, this compatibility checking can to a large extent be automated if we define the notion of compatibility in a sufficiently formal way. Based on a simple behavioural representation, we survey, propose and compare a number of formal definitions of the compatibility notion, and we illustrate them on simple examples.
ER -
%0 Journal Article
%1 keyhere
%A Bordeaux, Lucas
%A Salaün, Gwen
%A Berardi, Daniela
%A Mecella, Massimo
%D 2005
%J Technologies for E-Services
%K compatible composition imported service services web
%P 15--28
%T When are Two Web Services Compatible?
%U http://www.springerlink.com/content/4ufpt8kr3ngb6e17
%X Whether two web services are compatible depends not only on static properties like the correct typing of their message parameters, but also on their dynamic behaviour. Providing a simple description of the service behaviour based on process-algebraic or automata-based formalisms can help detecting many subtle incompatibilities in their interaction. Moreover, this compatibility checking can to a large extent be automated if we define the notion of compatibility in a sufficiently formal way. Based on a simple behavioural representation, we survey, propose and compare a number of formal definitions of the compatibility notion, and we illustrate them on simple examples.
ER -
@article{keyhere,
abstract = {Whether two web services are compatible depends not only on static properties like the correct typing of their message parameters, but also on their dynamic behaviour. Providing a simple description of the service behaviour based on process-algebraic or automata-based formalisms can help detecting many subtle incompatibilities in their interaction. Moreover, this compatibility checking can to a large extent be automated if we define the notion of compatibility in a sufficiently formal way. Based on a simple behavioural representation, we survey, propose and compare a number of formal definitions of the compatibility notion, and we illustrate them on simple examples.
ER -},
added-at = {2009-06-09T14:34:50.000+0200},
author = {Bordeaux, Lucas and Salaün, Gwen and Berardi, Daniela and Mecella, Massimo},
biburl = {https://www.bibsonomy.org/bibtex/2b796b7d826a5d8b27874391041ba8a34/hennig},
description = {SpringerLink - Buchkapitel},
interhash = {0166325cba17f9239c9f08c08e0ca9c3},
intrahash = {b796b7d826a5d8b27874391041ba8a34},
journal = {Technologies for E-Services},
keywords = {compatible composition imported service services web},
pages = {15--28},
timestamp = {2009-06-09T14:34:50.000+0200},
title = {When are Two Web Services Compatible?},
url = {http://www.springerlink.com/content/4ufpt8kr3ngb6e17},
year = 2005
}