By Topic

Extending the concept of transaction compensation

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

6 Author(s)
Chessell, M. ; IBM United Kingdom Laboratories Ltd., Hursley Park, Winchester, Hants SO21 2JN, UK ; Griffin, C. ; Vines, D. ; Butler, M.
more authors

The ability to compensate for previous activities, often in the case of failure or exceptional events, is an important feature of long-running business transactions. In this paper, we present several extensions to existing notions of compensation for business transactions. The extensions are described using a business process modeling language called StAC (Structured Activity Compensation) but are also placed in the context of IBM's BPBeans (Business Process Beans) enterprise technology. The meaning of the compensation mechanisms is made precise, as are issues of compensation scoping in multilevel transactions. The compensation extensions result in flexible and powerful mechanisms for modeling and implementing long-running business transactions.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Systems Journal  (Volume:41 ,  Issue: 4 )