Computer Science – Programming Languages
Scientific paper
2010-10-27
EPTCS 38, 2010, pp. 51-65
Computer Science
Programming Languages
In Proceedings ICE 2010, arXiv:1010.5308
Scientific paper
10.4204/EPTCS.38.7
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.
No associations
LandOfFree
Static vs Dynamic SAGAs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Static vs Dynamic SAGAs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Static vs Dynamic SAGAs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-484643