A new strategy for distributed compensations with interruption in long-running transactions

Authors:
Roberto Bruni;Anne Kersten;Ivan Lanese;Giorgio Spagnolo
Affiliations:
Department of Computer Science, University of Pisa, Italy;Institute for Andvanced Studies, IMT Lucca, Italy;Focus Team, University of Bologna/INRIA, Italy;Department of Computer Science, University of Pisa, Italy
Venue:
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Year:
2010

Citing 16
Cited 0

Sagas

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Petri nets are moniods

Information and Computation
A Process Compensation Language

IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Theoretical foundations for compensations in flow composition languages

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing two approaches to compensable flow composition

CONCUR 2005 - Concurrency Theory
Event-Based Service Coordination

Concurrency, Graphs and Models
A Process Calculus Analysis of Compensations

Trustworthy Global Computing
Dynamic Recovering of Long Running Transactions

Trustworthy Global Computing
Programming Sagas in SOCK

SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
The conversation calculus: a model of service-oriented computation

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Communicating transactions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A java inspired semantics for transactions in SOC

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Foundations of web transactions

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
On the expressive power of primitives for compensation handling

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A trace semantics for long-running transactions

CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose new denotational (trace-based) and operational semantics for parallel Sagas with interruption, prove the correspondence between the two and assess their merits w.r.t. existing proposals. The new semantics is realistic, in the sense that it guarantees that distributed compensations may only be observed after a fault actually occurred. Moreover, the operational semantics is defined in terms of (1-safe) Petri nets and hence retains causality and concurrency information about the events that can occur, not evident in the standard trace semantics.