메뉴 건너뛰기




Volumn 5364 LNCS, Issue , 2008, Pages 38-53

Protocol-based web service composition

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET PROTOCOLS; WEBSITES;

EID: 58049114817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89652-4_7     Document Type: Conference Paper
Times cited : (19)

References (16)
  • 2
    • 84880478628 scopus 로고    scopus 로고
    • Conversation specification: A new approach to design and analysis of e-service composition
    • ACM, New York
    • Bultan, T., Fu, X., Hull, R., Su, J.: Conversation specification: a new approach to design and analysis of e-service composition. In: WWW 2003. ACM, New York (2003)
    • (2003) WWW
    • Bultan, T.1    Fu, X.2    Hull, R.3    Su, J.4
  • 4
    • 22944452100 scopus 로고    scopus 로고
    • Automatic service composition based on behavioral descriptions
    • Berardi, D., Calvanese, D., Giacomo, G.D., Lenzerini, M., Mecella, M.: Automatic service composition based on behavioral descriptions. IJCIS 14(4), 333-376 (2005)
    • (2005) IJCIS , vol.14 , Issue.4 , pp. 333-376
    • Berardi, D.1    Calvanese, D.2    Giacomo, G.D.3    Lenzerini, M.4    Mecella, M.5
  • 5
    • 33745587348 scopus 로고    scopus 로고
    • Automatic composition of transition-based semantic web services with messaging
    • Berardi, D., Calvanese, D., Giaconio, G.D., Hull, R., Mecella, M.: Automatic composition of transition-based semantic web services with messaging. In: VLDB. pp. 613-624 (2005)
    • (2005) VLDB , pp. 613-624
    • Berardi, D.1    Calvanese, D.2    Giaconio, G.D.3    Hull, R.4    Mecella, M.5
  • 6
    • 37149018364 scopus 로고    scopus 로고
    • A lower bound on web services composition
    • Seidl, H, ed, FOSSACS 2007, Springer. Heidelberg
    • Muscholl, A., Walukiewicz, I.: A lower bound on web services composition. In: Seidl, H. (ed.) FOSSACS 2007. LNCS. vol. 4423, pp. 274-280. Springer. Heidelberg (2007)
    • (2007) LNCS , vol.4423 , pp. 274-280
    • Muscholl, A.1    Walukiewicz, I.2
  • 9
    • 35048860338 scopus 로고    scopus 로고
    • Traverso, P., Pistore, M.: Automated Composition of Semantic Web Services into Executable Processes. In: Mcllraith. S.A. Plexousakis. D., van Harmelen, F. (eds.) TSWC 2004. LNCS, 3298, pp. 380-394. Springer, Heidelberg (2004)
    • Traverso, P., Pistore, M.: Automated Composition of Semantic Web Services into Executable Processes. In: Mcllraith. S.A. Plexousakis. D., van Harmelen, F. (eds.) TSWC 2004. LNCS, vol. 3298, pp. 380-394. Springer, Heidelberg (2004)
  • 10
    • 58049103930 scopus 로고    scopus 로고
    • McIlraith, S., Son, T.: Adapting Golog for Composition of Semantic Web Services. In: KR 2002, pp. 482-493 (2002)
    • McIlraith, S., Son, T.: Adapting Golog for Composition of Semantic Web Services. In: KR 2002, pp. 482-493 (2002)
  • 11
    • 33745626091 scopus 로고    scopus 로고
    • Representing, analysing and managing web service protocols
    • Benatallah, B., Casati, F., Toumani, F.: Representing, analysing and managing web service protocols. DKE 58(3), 327-357 (2006)
    • (2006) DKE , vol.58 , Issue.3 , pp. 327-357
    • Benatallah, B.1    Casati, F.2    Toumani, F.3
  • 12
    • 0034911108 scopus 로고    scopus 로고
    • Jedrzejowicz, J., Szepietowski, A.: Shuffle languages are in p. TCS 250(1-2), 31-53 (2001)
    • Jedrzejowicz, J., Szepietowski, A.: Shuffle languages are in p. TCS 250(1-2), 31-53 (2001)
  • 13
    • 0000746072 scopus 로고
    • On the complexity of iterated shuffle
    • Warmuth, M.K., Haussler, D.: On the complexity of iterated shuffle. JCSS 28(3), 345-358 (1984)
    • (1984) JCSS , vol.28 , Issue.3 , pp. 345-358
    • Warmuth, M.K.1    Haussler, D.2
  • 14
    • 0000223972 scopus 로고
    • Parallel Program Schemata
    • Karp, R., Miller, R.: Parallel Program Schemata. JCSS 3(2). 147-195 (1969)
    • (1969) JCSS , vol.3 , Issue.2 , pp. 147-195
    • Karp, R.1    Miller, R.2
  • 15
    • 0000709547 scopus 로고
    • Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors
    • Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. Journal Math. 35, 413-422 (1913)
    • (1913) Amer. Journal Math , vol.35 , pp. 413-422
    • Dickson, L.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.