Abstract
Realizing the shortcomings of existing open-nested transaction models, we presented an extension to these models that is suitable for MAS in this chapter. Particularly, the support for non-recursive structures and the extensive support of cooperation through ECA rules coupling the transaction trees are completely new to the open-nested paradigm.
Considering the application-oriented requirement analysis presented in Chap. 2 and the technical requirements analysis of Chap. 5, we strongly feel that the proposed transaction model can face all its challenges specially through the powerful and yet flexible definition of the transaction trees and its bundling of normal and contingency behaviors in one structure. The transaction model allows for a full decentralization of the underlying middleware by introducing the Execution Agents. They are responsible for the robust execution of the transaction model. Although, we have formally proven the correctness of execution of the transaction model concerning its serializability and recoverability, the implementation of the model within the Execution Agent remains open. This is addressed in the following chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2001). The Agent Transaction Model. In: Nagi, K. (eds) Transactional Agents. Lecture Notes in Computer Science, vol 2249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45354-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-45354-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43046-9
Online ISBN: 978-3-540-45354-3
eBook Packages: Springer Book Archive