Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A Petri-net Coverability Model for Automatic Web Service Composition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan Xu ; Sch. of Inf. Eng., Yangzhou Univ., Yangzhou ; Bin Li ; Jun Wu

Web services are widely used because of their features of interoperability,loose-coupled and platform independent. Web services composition is one of the hottest topics in service computing area. In this paper a method based on Petri net coverability problem is proposed to handle automatic service composition. First each service is translated into component of Petri net and the input/output places with same semantics are merged. According to userpsilas input and desired output, the initial marking and target marking can be obtained. Then the coverability tree and coverability graph can be constructed. At last the node on the coverability graph which can cover the target marking should be find out, and shortest coverability path translated into smallest service executing sequence to reach the goal of automatic service composition.

Published in:

Industrial and Information Systems, 2009. IIS '09. International Conference on

Date of Conference:

24-25 April 2009