Transaction calculus (Invited paper)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Transaction-based services are increasingly being applied in solving many universal interoperability problems. Compensation is one typical feature for long-running transactions. This paper presents a design model for specifying the behaviour of compensable programs. The new model for handling exception and compensation is built as conservative extension of the standard relational model. The paper puts forward a mathematical framework for transactions where a transaction is treated as a mapping from its environment to compensable programs. We propose a transaction refinement calculus, and show that every transaction can be converted to a primitive one which simply consists of a forward activity and a compensation module.

Original languageEnglish
Title of host publicationUnifying Theories of Programming - Second International Symposium, UTP 2008, Revised Selected Papers
Pages2-21
Number of pages20
DOIs
StatePublished - 2010
Event2nd International Symposium on Unifying Theories of Programming, UTP 2008 - Dublin, Ireland
Duration: 8 Sep 200810 Sep 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5713 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Symposium on Unifying Theories of Programming, UTP 2008
Country/TerritoryIreland
CityDublin
Period8/09/0810/09/08

Fingerprint

Dive into the research topics of 'Transaction calculus (Invited paper)'. Together they form a unique fingerprint.

Cite this