By Topic

Fair BPEL processes transaction using non-repudiation protocols

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

4 Author(s)
Bilal, M. ; Oklahoma State Univ., Stillwater, OK, USA ; Thomas, J.P. ; Thomas, M. ; Abraham, S.

There is a need for protocols to achieve universal interoperability among Web services and to provide a fair and secure environment with non-repudiation. BPEL provides a language for the formal specification of business processes and business interaction protocols. In this paper we propose and verify a non-repudiation protocol using Petri nets for chain-linked business transactions and show that they may be specified in BPEL.

Published in:

Services Computing, 2005 IEEE International Conference on  (Volume:1 )

Date of Conference:

11-15 July 2005