×

A calculus for long-running transactions. (English) Zbl 1253.68056

Najm, Elie (ed.) et al., Formal methods for open object-based distributed systems. 6th IFIP WG 6.1 international conference, FMOODS 2003, Paris, France, November 19–21, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20491-1/pbk). Lect. Notes Comput. Sci. 2884, 124-138 (2003).
Summary: We study long-running transactions in open component-based distributed applications, such as web services platforms. Long-running transactions describe time-extensive activities that involve several distributed components. Henceforth, in case of failure, it is usually not possible to restore the initial state, and firing a compensation process is preferable. Despite the interest of such transactional mechanisms, a formal modeling of them is still lacking. In this paper we address this issue by designing an extension of the asynchronous \(\pi \)-calculus with long-running transactions (and sequences) – the \(\pi\mathfrak{t}\)-calculus. We study the practice of the \(\pi\mathfrak{t}\)-calculus, by discussing few paradigmatic examples, and its theory, by defining a semantics and providing a correct encoding of the \(\pi\mathfrak{t}\)-calculus into the asynchronous \(\pi \)-calculus.
For the entire collection see [Zbl 1029.00058].

MSC:

68M14 Distributed systems
68M11 Internet topics
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
PDFBibTeX XMLCite
Full Text: DOI