skip to main content
10.1145/1526709.1526890acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
poster

Automated synthesis of composite services with correctness guarantee

Published: 20 April 2009 Publication History

Abstract

In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified reception, and temporal constraints in Computation Tree Logic formula. An automated synthesis algorithm based on learning algorithm is introduced, which guarantees that the composite service is the most general way of coordinating services so that the correctness is ensured. We have implemented a prototype system evaluating the effectiveness and efficiency of our synthesis approach through an experimental study.

References

[1]
D. Berardi, D. Calvanese, G. De Giacomo, R. Hull, and M. Mecella. Automatic composition of transition-based semantic web services with messaging. In VLDB, pages 613--624, 2005.
[2]
A. Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. Nusmv 2: An opensource tool for symbolic model checking. In CAV '02, pages 359--364, 2002.
[3]
E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000.
[4]
X. Fu, T. Bultan, and J. Su. Analysis of interacting bpel web services. In WWW, pages 621--630, 2004.
[5]
R. Hull and J. Su. Tools for composite web services: a short overview. SIGMOD Rec., 34(2):86--95, 2005.
[6]
P. Manolios and R. J. Trefer. Safety and liveness in branching time. In LICS, pages 366--374, 2001.
[7]
R. L. Rivest and R. E. Schapire. Inference of finite automata using homing sequences. Inf. Comput., 103(2):299--347, 1993.

Cited By

View all
  • (2011)Certifying Security and Privacy Properties in the Internet of ServicesTrustworthy Internet10.1007/978-88-470-1818-1_17(221-234)Online publication date: 15-Jun-2011

Index Terms

  1. Automated synthesis of composite services with correctness guarantee

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      WWW '09: Proceedings of the 18th international conference on World wide web
      April 2009
      1280 pages
      ISBN:9781605584874
      DOI:10.1145/1526709

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 20 April 2009

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. composition synthesis
      2. correctness constraints
      3. learning algorithm

      Qualifiers

      • Poster

      Conference

      WWW '09
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)2
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 20 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2011)Certifying Security and Privacy Properties in the Internet of ServicesTrustworthy Internet10.1007/978-88-470-1818-1_17(221-234)Online publication date: 15-Jun-2011

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media