메뉴 건너뛰기




Volumn 19, Issue 2, 2008, Pages 429-451

Automatic service composition via simulation

Author keywords

[No Author keywords available]

Indexed keywords


EID: 44249113629     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054108005759     Document Type: Conference Paper
Times cited : (60)

References (36)
  • 6
    • 20444435185 scopus 로고    scopus 로고
    • Synthesis of Underspecified Composite e-Services based on Automated Reasoning
    • D. Berardi, D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Mecella. Synthesis of Underspecified Composite e-Services based on Automated Reasoning. In Proc. of ICSOC 2004, pages 105-114, 2004.
    • (2004) Proc. of ICSOC , pp. 105-114
    • Berardi, D.1    Calvanese, D.2    De Giacomo, G.3    Lenzerini, M.4    Mecella, M.5
  • 8
    • 84902518432 scopus 로고    scopus 로고
    • Basis for automatic service composition
    • D. Berardi, G. De Giacomo, and M. Mecella. Basis for automatic service composition. Tutorial at WWW 2005, 2005.
    • (2005)
    • Berardi, D.1    De Giacomo, G.2    Mecella, M.3
  • 9
    • 84880478628 scopus 로고    scopus 로고
    • Conversation Specification: A New Approach to Design and Analysis of E-Service Composition
    • T. Bultan, X. Fu, R. Hull, and J. Su. Conversation Specification: A New Approach to Design and Analysis of E-Service Composition. In Proc. of WWW 2003, 2003.
    • (2003) Proc. of WWW 2003
    • Bultan, T.1    Fu, X.2    Hull, R.3    Su, J.4
  • 12
    • 84880862136 scopus 로고    scopus 로고
    • Automatic synthesis of new behaviors from a library of available behaviors
    • G. De Giacomo and S. Sardiña. Automatic synthesis of new behaviors from a library of available behaviors. In Proc. of IJCAI 2007, pages 1866-1871, 2007.
    • (2007) Proc. of IJCAI , pp. 1866-1871
    • De Giacomo, G.1    Sardiña, S.2
  • 13
    • 0345358528 scopus 로고    scopus 로고
    • From bisimulation to simulation: Coarsest partition problems
    • R. Gentilini, C. Piazza, and A. Policriti. From bisimulation to simulation: Coarsest partition problems. J. Autom. Reasoning, 31(1):73-103, 2003.
    • (2003) J. Autom. Reasoning , vol.31 , Issue.1 , pp. 73-103
    • Gentilini, R.1    Piazza, C.2    Policriti, A.3
  • 14
    • 20444448188 scopus 로고    scopus 로고
    • Automated composition of e-services: Lookaheads
    • C. E. Gerede, R. Hull, O. H. Ibarra, and J. Su. Automated composition of e-services: lookaheads. In Proc. of ICSOC 2004, pages 252-262, 2004.
    • (2004) Proc. of ICSOC , pp. 252-262
    • Gerede, C.E.1    Hull, R.2    Ibarra, O.H.3    Su, J.4
  • 18
    • 0035658039 scopus 로고    scopus 로고
    • Answering Queries Using Views: A Survey
    • A. Y. Halevy. Answering Queries Using Views: A Survey. VLDB Journal, 10(4):270-294, 2001.
    • (2001) VLDB Journal , vol.10 , Issue.4 , pp. 270-294
    • Halevy, A.Y.1
  • 20
    • 0029488964 scopus 로고
    • Computing simulations on finite and infinite graphs
    • M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In Proc. of FOCS 1995, pages 453-462, 1995.
    • (1995) Proc. of FOCS , pp. 453-462
    • Henzinger, M.R.1    Henzinger, T.A.2    Kopke, P.W.3
  • 22
    • 0036036947 scopus 로고    scopus 로고
    • Data Integration: A Theoretical Perspective
    • M. Lenzerini. Data Integration: A Theoretical Perspective. In Proc. of PODS 2002, pages 233-246, 2002.
    • (2002) Proc. of PODS , pp. 233-246
    • Lenzerini, M.1
  • 23
    • 0011491265 scopus 로고    scopus 로고
    • Adapting Golog for Composition of Semantic Web Services
    • S. A. McIlraith and T. C. Son. Adapting Golog for Composition of Semantic Web Services. In Proc. of KR 2002, pages 482-496, 2002.
    • (2002) Proc. of KR , pp. 482-496
    • McIlraith, S.A.1    Son, T.C.2
  • 24
    • 0345566250 scopus 로고    scopus 로고
    • Composing Web Services on the Semantic Web
    • B. Medjahed, A. Bouguettaya, and A. K. Elmagarmid. Composing Web Services on the Semantic Web. VLDB Journal, 12(4):333-351, 2003.
    • (2003) VLDB Journal , vol.12 , Issue.4 , pp. 333-351
    • Medjahed, B.1    Bouguettaya, A.2    Elmagarmid, A.K.3
  • 26
    • 84988613226 scopus 로고
    • An algebraic definition of simulation between programs
    • R. Milner. An algebraic definition of simulation between programs. In Proc. of IJCAI 1971, pages 481-489, 1971.
    • (1971) Proc. of IJCAI , pp. 481-489
    • Milner, R.1
  • 27
    • 37149018364 scopus 로고    scopus 로고
    • A Lower Bound on Web Services Composition
    • Proc. of the 10th Int. Conf. on Foundations of Software Science and Computation Structures FoSSaCS 2007, of, Springer
    • A. Muscholl and I. Walukiewicz. A Lower Bound on Web Services Composition. In Proc. of the 10th Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS 2007), volume 4423 of LNCS. Springer, 2007.
    • (2007) LNCS , vol.4423
    • Muscholl, A.1    Walukiewicz, I.2
  • 29
    • 0024864157 scopus 로고
    • On the Synthesis of a Reactive Module
    • A. Pnueli and R. Rosner. On the Synthesis of a Reactive Module. In Proc. of POPL 1989, pages 179-190, 1989.
    • (1989) Proc. of POPL , pp. 179-190
    • Pnueli, A.1    Rosner, R.2
  • 30
    • 36348932143 scopus 로고    scopus 로고
    • Automatic synthesis of a global behavior from multiple distributed behaviors
    • S. Sardiña, F. Patrizi, and G. De Giacomo. Automatic synthesis of a global behavior from multiple distributed behaviors. In Proc. of AAAI 2007, pages 1063-1069, 2007.
    • (2007) Proc. of AAAI , pp. 1063-1069
    • Sardiña, S.1    Patrizi, F.2    De Giacomo, G.3
  • 31
    • 84947729408 scopus 로고    scopus 로고
    • S. K. Shukla, H. B. H. III, D. J. Rosenkrantz, and R. E. Stearns. On the complexity of relational problems for finite state processes. In Proc. of ICALP 1996, pages 466-477, 1996.
    • S. K. Shukla, H. B. H. III, D. J. Rosenkrantz, and R. E. Stearns. On the complexity of relational problems for finite state processes. In Proc. of ICALP 1996, pages 466-477, 1996.
  • 32
    • 84903199314 scopus 로고    scopus 로고
    • Simulation revisited
    • L. Tan and R. Cleaveland. Simulation revisited. In Proc. of TACAS 2001, pages 480-495, 2001.
    • (2001) Proc. of TACAS , pp. 480-495
    • Tan, L.1    Cleaveland, R.2
  • 33
    • 17044386331 scopus 로고    scopus 로고
    • Infinite Games and Verification
    • W.Thomas. Infinite Games and Verification. In Proc. of CAV 2002, 2002.
    • (2002) Proc. of CAV 2002
    • Thomas, W.1
  • 34
    • 0003666350 scopus 로고    scopus 로고
    • Information Integration using Logical Views
    • J. D. Ullman. Information Integration using Logical Views. Theoretical Computer Science, 239(2): 189-210, 2000.
    • (2000) Theoretical Computer Science , vol.239 , Issue.2 , pp. 189-210
    • Ullman, J.D.1
  • 35
    • 0004020827 scopus 로고
    • An Automata-Theoretic Approach to Fair Realizability and Synthesis
    • M. Y. Vardi. An Automata-Theoretic Approach to Fair Realizability and Synthesis. In Proc. of CAV 1995, 1995.
    • (1995) Proc. of CAV 1995
    • Vardi, M.Y.1
  • 36
    • 0942266857 scopus 로고    scopus 로고
    • Service Components for Managing the Life-Cycle of Service Compositions
    • J. Yang and M. P. Papazoglou. Service Components for Managing the Life-Cycle of Service Compositions. Information Systems, 29(2):97-125, 2004.
    • (2004) Information Systems , vol.29 , Issue.2 , pp. 97-125
    • Yang, J.1    Papazoglou, M.P.2


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