Name
Abstract | ||
|---|---|---|
This paper addresses the issue of automatic service composition. We first develop a framework in which the exported behavior of a service is described in terms of a so-called execution tree, that is an abstraction for its possible executions. We then study the case in which such exported behavior (i.e. the execution tree of the service) can be represented by a finite state machine (i.e. finite state transition system). In this specific setting, we devise sound, complete and terminating techniques both to check for the existence of a composition, and to return a composition, if one exists. We also analyze the computational complexity of the proposed algorithms. Finally, we present an open source prototype tool, called ESC (E-Service Composer), that implements our composition technique. To the best of our knowledge, our work is the first attempt to provide a provably correct technique for the automatic synthesis of service composition, in a framework where the behavior of services is explicitly specified. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1142/S0218843005001201 | INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS |
Keywords | Field | DocType |
service, composition, synthesis, behavior, automated reasoning | Transition system,Automated reasoning,Abstraction,Programming language,Computer science,Finite-state machine,Finite state,Theoretical computer science,Service composition,Database,Computational complexity theory | Journal |
Volume | Issue | ISSN |
14 | 4 | 0218-8430 |
Citations | PageRank | References |
89 | 3.07 | 42 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniela Berardi | 1 | 1067 | 51.72 |
| Diego Calvanese | 2 | 10262 | 792.67 |
| Giuseppe De Giacomo | 3 | 7004 | 590.40 |
| Maurizio Lenzerini | 4 | 9620 | 1522.63 |
| massimo mecella | 5 | 1841 | 168.35 |