English

Static vs Dynamic SAGAs

Programming Languages 2010-10-28 v1

Abstract

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.

Cite

@article{arxiv.1010.5569,
  title  = {Static vs Dynamic SAGAs},
  author = {Ivan Lanese},
  journal= {arXiv preprint arXiv:1010.5569},
  year   = {2010}
}

Comments

In Proceedings ICE 2010, arXiv:1010.5308

R2 v1 2026-06-21T16:34:40.294Z