Static vs Dynamic SAGAs

Ivan Lanese
(Focus Team, University of Bologna/INRIA)

SAGAs calculi (or simply SAGAs) have been proposed by Bruni et al. as a model for long-running transactions. The approach therein can be considered static, while a dynamic approach has been proposed by Lanese and Zavattaro. In this paper we first extend both static SAGAs (in the centralized interruption policy) and dynamic SAGAs to deal with nesting, then we compare the two approaches.

In Simon Bliudze, Roberto Bruni, Davide Grohmann and Alexandra Silva: Proceedings Third Interaction and Concurrency Experience Guaranteed Interaction (ICE 2010), Amsterdam, The Netherlands, 10th of June 2010, Electronic Proceedings in Theoretical Computer Science 38, pp. 51–65.
Published: 26th October 2010.

ArXived at: https://dx.doi.org/10.4204/EPTCS.38.7 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org