Dynamic Recovering of Long Running Transactions

António Maria Lobo César Alarcão Ravara; Carla Maria Gonçalves Ferreira

doi:10.1007/978-3-642-00945-7

Dynamic Recovering of Long Running Transactions

António Maria Lobo César Alarcão Ravara, Carla Maria Gonçalves Ferreira

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

20 Citations (Scopus)

Abstract

Most business applications rely on the notion of long running transaction as a fundamental building block. This paper presents a calculus for modelling long running transactions within the framework of the π-calculus, with support for compensation as a recovery mechanism. The underlying model of this calculus is the asynchronous polyadic π-calculus, with transaction scopes and dynamic installation of compensation processes. We add to the framework a type system which guarantees that transactions are unequivocally identified, ensuring that upon a failure the correct compensation process is invoked. Moreover, the operational semantics of the calculus ensures both installation and activation of the compensation of a transaction.

Original language	Unknown
Title of host publication	Lecture Notes in Computer Science
Pages	201-215
Volume	5474
DOIs	https://doi.org/10.1007/978-3-642-00945-7
Publication status	Published - 1 Jan 2009
Event	International Symposium on Trustworthy Global Computing - Duration: 1 Jan 2008 → …

Conference

Conference	International Symposium on Trustworthy Global Computing
Period	1/01/08 → …

Access to Document

10.1007/978-3-642-00945-7

Cite this

@inproceedings{18b7168d9cb94815b91ad248d3234a06,

title = "Dynamic Recovering of Long Running Transactions",

abstract = "Most business applications rely on the notion of long running transaction as a fundamental building block. This paper presents a calculus for modelling long running transactions within the framework of the π-calculus, with support for compensation as a recovery mechanism. The underlying model of this calculus is the asynchronous polyadic π-calculus, with transaction scopes and dynamic installation of compensation processes. We add to the framework a type system which guarantees that transactions are unequivocally identified, ensuring that upon a failure the correct compensation process is invoked. Moreover, the operational semantics of the calculus ensures both installation and activation of the compensation of a transaction.",

author = "Ravara, \{Ant{\'o}nio Maria Lobo C{\'e}sar Alarc{\~a}o\} and Ferreira, \{Carla Maria Gon{\c c}alves\}",

year = "2009",

month = jan,

day = "1",

doi = "10.1007/978-3-642-00945-7",

language = "Unknown",

isbn = "978-3-642-00944-0",

volume = "5474",

pages = "201--215",

booktitle = "Lecture Notes in Computer Science",

note = "International Symposium on Trustworthy Global Computing ; Conference date: 01-01-2008",

}

TY - GEN

T1 - Dynamic Recovering of Long Running Transactions

AU - Ravara, António Maria Lobo César Alarcão

AU - Ferreira, Carla Maria Gonçalves

PY - 2009/1/1

Y1 - 2009/1/1

N2 - Most business applications rely on the notion of long running transaction as a fundamental building block. This paper presents a calculus for modelling long running transactions within the framework of the π-calculus, with support for compensation as a recovery mechanism. The underlying model of this calculus is the asynchronous polyadic π-calculus, with transaction scopes and dynamic installation of compensation processes. We add to the framework a type system which guarantees that transactions are unequivocally identified, ensuring that upon a failure the correct compensation process is invoked. Moreover, the operational semantics of the calculus ensures both installation and activation of the compensation of a transaction.

AB - Most business applications rely on the notion of long running transaction as a fundamental building block. This paper presents a calculus for modelling long running transactions within the framework of the π-calculus, with support for compensation as a recovery mechanism. The underlying model of this calculus is the asynchronous polyadic π-calculus, with transaction scopes and dynamic installation of compensation processes. We add to the framework a type system which guarantees that transactions are unequivocally identified, ensuring that upon a failure the correct compensation process is invoked. Moreover, the operational semantics of the calculus ensures both installation and activation of the compensation of a transaction.

U2 - 10.1007/978-3-642-00945-7

DO - 10.1007/978-3-642-00945-7

M3 - Conference contribution

SN - 978-3-642-00944-0

VL - 5474

SP - 201

EP - 215

BT - Lecture Notes in Computer Science

T2 - International Symposium on Trustworthy Global Computing

Y2 - 1 January 2008

ER -