Skip to main content
SpringerLink
Log in

Efficient Constraint Verification in Service Composition Design and Execution (Short Paper)

  • Conference paper
  • First Online:
On the Move to Meaningful Internet Systems: OTM 2016 Conferences (OTM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10033))

Abstract

Most methods that have been proposed to solve the problem of web service composition only consider input and output parameters of services in order to solve the composition problem. However, there are other factors that affect composition and execution of composite services such as constraints. Constraints can be used to express customer requirements on services features. Additionally, most real-world web services have constraints that specify their limitations and use restrictions. Constraint verification has significant impact on composition and execution of composite services. In particular, run time verification of service constraints can result in the failure of the execution of composite services and eventually waste computational resources. Such failures can not always be predicted as the verification of some services depends on execution effects of other services inside a composite plan. In this paper, we focus on verification of constraints during the composition and execution of composite services.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hamadi, R., Benatallah, B.: A petri net-based model for web service composition. In: Proceedings of the 14th Australasian Database Conference vol. 17, pp. 191–200. Australian Computer Society, Inc. (2003)

    Google Scholar 

  2. Lécué, F., Léger, A.: A formal model for semantic web service composition. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 385–398. Springer, Heidelberg (2006). doi:10.1007/11926078_28

    Chapter  Google Scholar 

  3. Berardi, D., Calvanese, D., Giacomo, G., Lenzerini, M., Mecella, M.: Automatic composition of e-services that export their behavior. In: Orlowska, M.E., Weerawarana, S., Papazoglou, M.P., Yang, J. (eds.) ICSOC 2003. LNCS, vol. 2910, pp. 43–58. Springer, Heidelberg (2003). doi:10.1007/978-3-540-24593-3_4

    Chapter  Google Scholar 

  4. Oh, S.C., Lee, D., Kumara, S.R.: Effective web service composition in diverse and large-scale service networks. Serv. Comput. IEEE Trans. 1(1), 15–32 (2008)

    Article  Google Scholar 

  5. Zheng, X., Yan, Y.: An efficient syntactic web service composition algorithm based on the planning graph model. In: Proceedings of the IEEE International Conference on Web Services (ICWS 2008), pp. 691–699. IEEE (2008)

    Google Scholar 

  6. Hashemian, S.V., Mavaddat, F.: A graph-based approach to web services composition. In: The 2005 Symposium on Applications and the Internet, pp. 183–189, January 2005

    Google Scholar 

  7. Wang, P., Ding, Z., Jiang, C., Zhou, M.: Constraint-aware approach to web service composition. IEEE Trans. Syst. Man Cybern. Syst. 44(6), 770–784 (2014)

    Article  Google Scholar 

  8. Rao, J., Su, X.: A survey of automated web service composition methods. In: Cardoso, J., Sheth, A. (eds.) SWSWPC 2004. LNCS, vol. 3387, pp. 43–54. Springer, Heidelberg (2005). doi:10.1007/978-3-540-30581-1_5

    Chapter  Google Scholar 

  9. McIlraith, S., Son, T.C.: Adapting golog for composition of semantic web services. KR 2, 482–493 (2002)

    Google Scholar 

  10. Oh, S.C., Lee, D., Kumara, S.R.T.: Web service planner (wspr): An effective and scalable web service composition algorithm. Int. J. Web Serv. Res. 4(1), 1–22 (2007)

    Article  Google Scholar 

  11. Ponnekanti, S.R., Fox, A.: Sword: A developer toolkit for web service composition. In: Proceedings of the Eleventh International World Wide Web Conference, Honolulu, HI. vol. 45 (2002)

    Google Scholar 

  12. Aggarwal, R., Verma, K., Miller, J., Milnor, W.: Constraint driven web service composition in meteor-s. In: Services Computing, pp. 23–30, Sept 2004

    Google Scholar 

  13. Channa, N.: Constraint satisfaction in dynamic web service composition. In: Sixteenth International Workshop on Database and Expert Systems Applications Proceedings, pp. 658–664. IEEE (2005)

    Google Scholar 

  14. Moghaddam, A., Davis, J.G.: Service selection in web service composition: a comparative review of existing approaches. In: Bouguettaya, A., Sheng, Q.Z., Daniel, F. (eds.) Web Serv. Found., pp. 321–346. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  15. Ben Hassine, A., Matsubara, S., Ishida, T.: A constraint-based approach to horizontal web service composition. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 130–143. Springer, Heidelberg (2006). doi:10.1007/11926078_10

    Chapter  Google Scholar 

  16. Papazoglou, M.: Web services: principles and technology. Pearson Education, Englewood Cliffs (2008)

    Google Scholar 

  17. Lee, C.: On quality of service optimization with discrete qos options. In: Real-Time Technology and Applications Symposium, pp. 276–286. IEEE (1999)

    Google Scholar 

  18. Li, J., Yan, Y., Lemire, D.: Full solution indexing for top-k web service composition

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Concordia University, Montreal, QC, Canada

    Touraj Laleh, Joey Paquet, Serguei A. Mokhov & Yuhong Yan

Authors
  1. Touraj Laleh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joey Paquet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Serguei A. Mokhov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yuhong Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Touraj Laleh .

Editor information

Editors and Affiliations

  1. ADAPT Centre, Trinity College Dublin, Dublin 2, Ireland

    Christophe Debruyne

  2. University of Lorraine, Vandoeuvre-les-Nancy, France

    Hervé Panetto

  3. TU Graz, Graz, Austria

    Robert Meersman

  4. La Trobe University, Melbourne, Australia

    Tharam Dillon

  5. Institute of Computer Languages, TU Wien, Vienna, Austria

    eva Kühn

  6. ADAPT Centre, Trinity College Dublin, Dublin 2, Ireland

    Declan O'Sullivan

  7. Università degli Studi di Milano Crema, Crema, Italy

    Claudio Agostino Ardagna

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Laleh, T., Paquet, J., Mokhov, S.A., Yan, Y. (2016). Efficient Constraint Verification in Service Composition Design and Execution (Short Paper). In: Debruyne, C., et al. On the Move to Meaningful Internet Systems: OTM 2016 Conferences. OTM 2016. Lecture Notes in Computer Science(), vol 10033. Springer, Cham. https://doi.org/10.1007/978-3-319-48472-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48472-3_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48471-6

  • Online ISBN: 978-3-319-48472-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation