A lower bound on web services composition

Logical Methods in Computer Science

Volumn 4, Issue 2, 2008, Pages

  Muscholl, Anca ^a   Walukiewicz, Igor ^b  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Automata simulation; Complexity; Web services composition

Indexed keywords

AUTOMATA SIMULATION; COMPLEXITY; COMPOSITION PROBLEM; LOWER BOUNDS; ROMAN MODEL; UPPER BOUND; WEB SERVICES COMPOSITION; EXPTIME;

AUTOMATA THEORY; WEBSITES; COMPUTER AIDED SOFTWARE ENGINEERING;

WEB SERVICES;

EID: 67349288155     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(2:5)2008     Document Type: Article

References (12)

1. G. Alonso, F. Casati, H. Kuno, and V. Machiraju. Web Services. Concepts, Architectures and Applica-tions. Springer, 2004.
2. D. Berardi, D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Mecella. Automatic composition of e-services that export their behavior. In Proc. of the 1st Int. Conf. on Service Oriented Computing (ICSOC 2003), LNCS 2910, pp. 43-58, 2003.
3. D. Berardi, D. Calvanese, G. D. Giacomo, R. Hull, and M. Mecella. Automatic composition of web services in Colombo. In SEBD 2005, pages 8-15, 2005.
4. D. Berardi, D. Calvanese, G. D. Giacomo, R. Hull, and M. Mecella. Automatic composition of web services with messaging. In VLDB 2005, pages 613-624, 2005.
5. D. Brand and P. Zafiropulo. On communicating finite-state machines. J. ACM 30(2): 323-342, 1983.
6. A. K. Chandra, D. Kozen and L. J. Stockmeyer. Alternation. J. ACM 28(1): 114-133, 1981.
7. A. Deutsch, L. Sui, V. Vianu, and D. Zhou. Verification of communicating data-driven web services. In Symposium on Principles of Database Systems (PODS), pp. 90-99, 2006.
8. X. Fu, T. Bultan, and J. Su. Conversation protocols: a formalism for specification and verification of reactive electronic services. In Theor. Comput. Sci. 328(1-2): 19-37, 2004.
9. R. Hull, M. Benedikt, V. Christophides, J. Su. E-services: a look behind the curtain. In Symposium on Principles of Database Systems (PODS), pp. 1-14, 2003.
10. F. Laroussinie and Ph. Schnoebelen. The state explosion problem from trace to bisimulation equivalence. In FoSSaCS 2000, LNCS 1784, pp. 192-207, 2000.
11. A. Muscholl and I. Walukiewicz. A lower bound on Web services composition. In Proc. of FoSSaCS'07, LNCS 4423, pp. 274-286, 2007.
12. J. Srba. Roadmap of infinite results. Bulletin of the EATCS 78, pages 163-175, 2002. See also http://www. brics. dk/_srba/roadmap.