Conversations in service-oriented computation are frequently long running. In such a setting, traditional ACID properties of transactions cannot be reasonably implemented, and compensation mechanisms seem to provide convenient techniques to, at least, approximate them. In this paper, we investigate the representation and analysis of structured compensating transactions within a process calculus model, by embedding in the Conversation Calculus certain structured compensation programming abstractions inspired by the ones proposed by Butler, Ferreira, and Hoare. We prove the correctness of the embedding after developing a general notion of stateful model for structured compensations and related results, and showing that the embedding induces such a model.
|Title of host publication||Lecture Notes in Computer Science, Springer-Verlag|
|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 → …|