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.
|Title of host publication||Lecture Notes in Computer Science|
|Publication status||Published - 1 Jan 2009|
|Event||International Symposium on Trustworthy Global Computing - |
Duration: 1 Jan 2008 → …
|Conference||International Symposium on Trustworthy Global Computing|
|Period||1/01/08 → …|