메뉴 건너뛰기




Volumn 412, Issue 48, 2011, Pages 6736-6749

On the computational complexity of behavioral description-based web service composition

Author keywords

Behavioral description; Computational complexity; Incomplete information; Web service composition

Indexed keywords

APPROXIMATION SOLUTION; AUTOMATIC CONSTRUCTION; BEHAVIORAL DESCRIPTIONS; COMPLETE INFORMATION; COMPOSITION PROBLEM; INCOMPLETE INFORMATION; WEB SERVICE COMPOSITION;

EID: 80053970818     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.04.020     Document Type: Conference Paper
Times cited : (9)

References (32)
  • 3
    • 16244379579 scopus 로고    scopus 로고
    • On automating Web services discovery
    • DOI 10.1007/s00778-003-0117-x
    • B. Benatallah, M. Hacid, A. Léger, C. Rey, and F. Toumani On automating web services discovery VLDB Journal 14 1 2005 84 96 (Pubitemid 40454275)
    • (2005) VLDB Journal , vol.14 , Issue.1 , pp. 84-96
    • Benatallah, B.1    Hacid, M.-S.2    Leger, A.3    Rey, C.4    Toumani, F.5
  • 9
    • 0001449325 scopus 로고
    • Temporal and modal logic
    • J. van Leeuwen, Elsevier Science Publishers
    • E. Emerson Temporal and modal logic J. van Leeuwen, Handbook of Theoretical Computer Science, vol. B 1990 Elsevier Science Publishers 995 1072
    • (1990) Handbook of Theoretical Computer Science, Vol. B , pp. 995-1072
    • Emerson, E.1
  • 13
    • 24344444145 scopus 로고    scopus 로고
    • Tools for composite web services: A short overview
    • DOI 10.1145/1083784.1083807
    • R. Hull, and J. Su Tools for composite web services: a short overview SIGMOD Record 34 2 2005 86 95 (Pubitemid 41260016)
    • (2005) SIGMOD Record , vol.34 , Issue.2 , pp. 86-95
    • Hull, R.1    Su, J.2
  • 15
    • 57649219787 scopus 로고    scopus 로고
    • Computational complexity of web service composition based on behavioral descriptions
    • H. Kil, W. Nam, D. Lee, Computational complexity of web service composition based on behavioral descriptions, in: IEEE Int'l Conf. on Tools with Artificial Intelligence, 2008, pp. 359363.
    • (2008) IEEE Int'l Conf. on Tools with Artificial Intelligence , pp. 359-363
    • Kil, H.1    Nam, W.2    Lee, D.3
  • 16
    • 36349008139 scopus 로고    scopus 로고
    • On the partial observability of temporal uncertainty
    • AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
    • M. Moffitt, On the partial observability of temporal uncertainty, in: Proceedings of National Conference on Artificial Intelligence, AAAI-07, 2007, pp. 10311037. (Pubitemid 350149705)
    • (2007) Proceedings of the National Conference on Artificial Intelligence , vol.2 , pp. 1031-1037
    • Moffitt, M.D.1
  • 20
    • 33646164715 scopus 로고    scopus 로고
    • OASIS
    • OASIS, UDDI version 3.0.2, 2004. http://uddi.xml.org/.
    • (2004) UDDI Version 3.0.2
  • 24
    • 49149133038 scopus 로고
    • The temporal semantics of concurrent programs
    • A. Pnueli The temporal semantics of concurrent programs Theoretical Computer Science 13 1981 45 60
    • (1981) Theoretical Computer Science , vol.13 , pp. 45-60
    • Pnueli, A.1
  • 26
    • 0014776888 scopus 로고
    • Relationships between nondeterministic and deterministic tape complexities
    • W.J. Savitch Relationships between nondeterministic and deterministic tape complexities Journal of Computer and System Sciences 4 2 1970 177 192
    • (1970) Journal of Computer and System Sciences , vol.4 , Issue.2 , pp. 177-192
    • Savitch, W.J.1
  • 27
  • 29
    • 70449480334 scopus 로고    scopus 로고
    • W3C
    • W3C, SOAP version 1.2, 2007. http://www.w3.org/TR/soap/.
    • (2007) SOAP Version 1.2
  • 31
    • 40949146968 scopus 로고    scopus 로고
    • Framework for web service query algebra and optimization
    • Q. Yu, and A. Bouguettaya Framework for web service query algebra and optimization ACM Transactions on Web 2 1 2008 1 35
    • (2008) ACM Transactions on Web , vol.2 , Issue.1 , pp. 1-35
    • Yu, Q.1    Bouguettaya, A.2
  • 32
    • 34248525624 scopus 로고    scopus 로고
    • Efficient algorithms for web services selection with end-to-end qos constraints
    • T. Yu, Y. Zhang, and K.-J. Lin Efficient algorithms for web services selection with end-to-end qos constraints ACM Transactions on Web 1 1 2007 6
    • (2007) ACM Transactions on Web , vol.1 , Issue.1 , pp. 6
    • Yu, T.1    Zhang, Y.2    Lin, K.-J.3


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