Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-31811-8_2 | TES |
Keywords | Field | DocType |
automata-based formalisms,simple description,dynamic behaviour,correct typing,service behaviour,web service,formal definition,compatibility checking,simple example,simple behavioural representation,compatibility notion,process algebra | Asynchronous communication,Compatibility (mechanics),Computer science,Automaton,Theoretical computer science,Web service,Process calculus,Rotation formalisms in three dimensions | Conference |
Volume | ISSN | ISBN |
3324 | 0302-9743 | 3-540-25049-2 |
Citations | PageRank | References |
86 | 3.96 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lucas Bordeaux | 1 | 594 | 36.28 |
| Gwen Salaün | 2 | 988 | 71.03 |
| Daniela Berardi | 3 | 1067 | 51.72 |
| massimo mecella | 4 | 1841 | 168.35 |