A lower bound on web services composition (2005)
Cached
Download Links
- [www.lsv.ens-cachan.fr]
- [www.lsv.ens-cachan.fr]
- DBLP
Other Repositories/Bibliography
by
Anca Muscholl
,
Igor Walukiewicz
,
Université Bordeaux
| Citations: | 14 - 0 self |
BibTeX
@MISC{Muscholl05alower,
author = {Anca Muscholl and Igor Walukiewicz and Université Bordeaux},
title = {A lower bound on web services composition},
year = {2005}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the specification by a fully asynchronous product of the given services. We show an EXPTIME-lower bound for this problem, thus matching the known upper bound. Our result also applies to richer models of web services, such as the Roman model.
Citations
| 201 | On Communicating Finite-State Machines - Brand, Zafiropulo - 1983 |
| 101 | M.: Automatic composition of e-services that export their behavior - Berardi, Calvanese, et al. - 2003 |
| 95 | Web Services: concepts, Architectures and Applications. Data-Centric Systems and Applications - Alonso, Casati, et al. - 2004 |
| 93 | E-services: A look behind the curtain - Hull, Benedikt, et al. - 2003 |
| 62 | Conversation protocols: a formalism for specification and verification of reactive electronic services - Fu, Bultan, et al. - 2004 |
| 40 | Automated Composition of Web Services by Planning at the Knowledge Level - Pistore, Marconi, et al. - 2005 |
| 28 | Specification and verification of data-driven web services - Deutsch, Sui, et al. - 1999 |
| 6 | The state explosion problem from trace to bisimulation equivalence - Schnoebelen - 2000 |
| 5 | Automatic composition of web services in Colombo - Berardi, Calvanese, et al. - 2005 |
| 1 | Automatic composition of web services with messaging - Berardi, Calvanese, et al. - 2005 |
