General dynamic recovery for compensating CSP

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

Compensation is a technique to roll-back a system to a consistent state in case of failure. Recovery mechanisms for compensating calculi specify the order of execution of compensation sequences. Dynamic recovery means that the order of execution is determined at runtime. In this paper, we define an extension of Compensating CSP, called DEcCSP, with general dynamic recovery. We provide a formal, operational semantics for the calculus, and illustrate its expressive power with a case study. In contrast with previous versions of Compensating CSP, DEcCSP provides mechanisms to replace or discard compensations at runtime. Additionally, we bring back to DEcCSP standard CSP operators that are not available in other compensating CSP calculi, and introduce channel communication.

Cite

CITATION STYLE

APA

Al-Humaimeedy, A. S., & Fernández, M. (2014). General dynamic recovery for compensating CSP. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 143, pp. 3–16). Open Publishing Association. https://doi.org/10.4204/EPTCS.143.1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free