Name
Abstract | ||
|---|---|---|
In this paper we study the issue of service composition, for services that export a representation of their behavior in the form of a finite deterministic transition system. In particular, given a specification of the target service requested by the client as a finite deterministic transition system, the problem we face is how we can exploit the computations of the available services for realizing the computations of the target service. While ways to tackle such a problem are known, in this paper we present a new technique that is based on the notion of simulation, which is still optimal from the computational complexity point. Notably, such a technique, opens up the possibility of devising composition in a "just-in-time" fashion. Indeed, we show that, by exploiting simulation, it is actually possible to implicitly compute all possible compositions at once, and delay the choice of the actual composition to run-time. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1142/S0129054108005759 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
computational complexity | Transition system,Combinatorics,Computer science,Exploit,Theoretical computer science,Service composition,Computational complexity theory,Computation,Distributed computing | Journal |
Volume | Issue | ISSN |
19 | 2 | 0129-0541 |
Citations | PageRank | References |
42 | 1.34 | 27 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniela Berardi | 1 | 1067 | 51.72 |
| Fahima Cheikh | 2 | 69 | 3.77 |
| Giuseppe De Giacomo | 3 | 7004 | 590.40 |
| Fabio Patrizi | 4 | 576 | 39.88 |