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.
Keywords: Automata simulation, complexity, web services composition.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alonso, G., et al.: Web Services. Concepts, Architectures and Applications. Springer, Heidelberg (2004)
Berardi, D., et al.: Automatic composition of e-services that export their behavior. In: Orlowska, M.E., et al. (eds.) ICSOC 2003. LNCS, vol. 2910, pp. 43–58. Springer, Heidelberg (2003)
Berardi, D., et al.: Automatic composition of web services in colombo. In: SEBD 2005, pp. 8–15 (2005)
Berardi, D., et al.: Automatic composition of web services with messaging. In: VLDB 2005, pp. 613–624 (2005)
Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)
Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981)
Deutsch, A., Sui, L., Vianu, V.: Specification and verification of data-driven web services. In: Symposium on Principles of Database Systems (PODS) (2004)
Fu, X., Bultan, T., Su, J.: Conversation protocols: a formalism for specification and verification of reactive electronic services. Theor. Comput. Sci. 328(1-2), 19–37 (2004)
Hull, R., et al.: E-services: a look behind the curtain. In: Symposium on Principles of Database Systems (PODS), pp. 1–14 (2003)
Laroussinie, F., Schnoebelen, P.: The state explosion problem from trace to bisimulation equivalence. In: Tiuryn, J. (ed.) ETAPS 2000 and FOSSACS 2000. LNCS, vol. 1784, pp. 192–207. Springer, Heidelberg (2000)
Pistore, M., et al.: Automated composition of web services by planning at the knowledge level. In: International Joint Conference on Artificial Intelligence (IJCAI) (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Muscholl, A., Walukiewicz, I. (2007). A Lower Bound on Web Services Composition. In: Seidl, H. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2007. Lecture Notes in Computer Science, vol 4423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71389-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-71389-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71388-3
Online ISBN: 978-3-540-71389-0
eBook Packages: Computer ScienceComputer Science (R0)