By Topic

Timed Modeling and Verification of BPEL Processes Using Time Petri Nets

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
$33 $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

5 Author(s)
Wei Song ; State Key Lab. for Novel Software Technol., Nanjing Univ., Nanjing, China ; Xiaoxing Ma ; Chunyang Ye ; Wanchun Dou
more authors

The execution time, an important criterion to measure the quality of a BPEL process, can be influenced by some slow external partner services (i.e., some long-running services). Therefore, it is desirable to specify response time of services into the SLAs (service level agreements). In this way, service consumers could verify whether the candidate services satisfy the expected time requirements before they are invoked. However, existing solutions are time-consuming especially when the BPEL process is quite complex (e.g., involving parallel structures and loops) and the number of candidate services is huge. To address this problem, in this paper, we propose a time Petri nets-based verification approach that efficiently verifies time requirements for a BPEL process. This allows service consumers to quickly identify suitable partner services that satisfy the time requirements at service looking up stage.

Published in:

2009 Ninth International Conference on Quality Software

Date of Conference:

24-25 Aug. 2009