By Topic

Automatic Protocol Conformance Checking of Recursive and Parallel BPEL Systems

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

2 Author(s)
Both, A. ; Inst. of Comput. Sci., Univ. of Halle, Halle ; Zimmermann, W.

Today model checking of Web Services formulated in BPEL is often reduced by transforming BPEL-processes to Petri nets. These can be model checked using traditional approaches. If recursion is present in the BPEL model this approach hides some possible violations of the wished behaviour. We present an approach which allows the Web Service developer to formulate more properties of the required usage of the Web Service and provide a tool that checks whether these requirements are satisfied in a Web Service based system. We use finite state machines to specify permitted sequences of receivable interactions and call them service protocols. In this paper we will show that it is possible to use BPEL representations and service protocols to check if a sequence of receivable interactions that violates a service protocol can occur. We achieve this result by translating BPEL to Process Algebra Nets (introduced by Mayr ) and applying the approach of Mayr for model checking Process Algebra Nets. Our approach computes counterexamples even for recursive and parallel programs including synchronization.

Published in:

on Web Services, 2008. ECOWS '08. IEEE Sixth European Conference

Date of Conference:

12-14 Nov. 2008