Abstract | ||
---|---|---|
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 \tau{\hbox{-}}composability to cater for partial and total composability. We also propose a set of algorithms for checking composability. Finally, we conduct a performance study (analytical and experimental) of the proposed algorithms. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1109/TKDE.2005.101 | Knowledge and Data Engineering, IEEE Transactions |
Keywords | Field | DocType |
composability model,semantic web services,qualitative level,static semantic,multilevel composability model,unexpected failure,total composability,composability degree,web service,proposed algorithm,performance study,dynamic semantic,investments,ontology,indexing terms,prototypes,web services,natural languages,ontologies,algorithm design and analysis,semantic web | Ontology (information science),Programming language,Computer science,Semantic Web,Natural language,Parsing,Web service,Composability,Semantics,Knowledge acquisition | Journal |
Volume | Issue | ISSN |
17 | 7 | 1041-4347 |
Citations | PageRank | References |
96 | 5.13 | 12 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Brahim Medjahed | 1 | 1077 | 73.34 |
Athman Bouguettaya | 2 | 2579 | 267.41 |