Algebraic semantics for compensable transactions

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

7 Scopus citations

Abstract

This paper presents the algebraic semantics of a novel transactional language t-calculus. This language focuses on modeling long running transactions in terms of compensable transactions, showing how the compensations can be orchestrated to ensure atomicity. The typical operators of sequential and parallel compositions are redefined so that the corresponding compensations will be activated in a suitable order whenever some failure occurs in later stage. In addition, we investigate more transactional operators, such as speculative choice, exception handling, alternative forwarding and programmable compensation. The wise use of these constructs is rather helpful to set up a flexible and effective business process. We present a clear algebraic semantics for t-calculus and derive its operational semantics mechanically based on a given derivation strategy. This work provides a foundation for optimization and implementation of this language.

Original languageEnglish
Title of host publicationTheoretical Aspects of Computing - ICTAC 2007- 4th International Colloquium, Proceedings
PublisherSpringer Verlag
Pages306-321
Number of pages16
ISBN (Print)9783540752905
DOIs
StatePublished - 2007
Event4th International Colloquium on Theoretical Aspects of Computing, ICTAC 2007 - Macao, China
Duration: 26 Sep 200728 Sep 2007

Publication series

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

Conference

Conference4th International Colloquium on Theoretical Aspects of Computing, ICTAC 2007
Country/TerritoryChina
CityMacao
Period26/09/0728/09/07

Fingerprint

Dive into the research topics of 'Algebraic semantics for compensable transactions'. Together they form a unique fingerprint.

Cite this