A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
We propose a composability model to ascertain that Web services can safely be combined, hence avoiding unexpected failures at runtime. Composability is checked through a set of rules organized into four levels: syntactic, static semantic, dynamic semantic, and qualitative levels. We introduce the concepts of composability degree and -composability to cater for partial and total composability. We also propose a set of algorithms for checking composability. Finally, we conduct a performance studydoi:10.1109/tkde.2005.101 fatcat:cevc2p73gngo7lxic52taaatxu