Communicating Transactions
File Type:
PDFItem Type:
Conference PaperDate:
2010Citation:
Edsko de Vries, Vasileios Koutavas and Matthew Hennessy., Communicating Transactions, Lecture Notes in Computer Science, 21st International Conference on Concurrency Theory (CONCUR 2010), Paris, France, 6269, 2010, Springer, 2010, 569-583Download Item:
Communicating.pdf (Published (author's copy) - Peer Reviewed) 412.4Kb
Abstract:
We propose a novel language construct called communicating transactions, obtained by dropping the isolation requirement from
classical transactions, which can be used to model automatic error re-
covery in distributed systems. We extend CCS with this construct and
give a simple semantics for the extended calculus, called TransCCS. We
develop a behavioural theory which is sound and complete with respect
to the may-testing preorder, and use it to prove interesting laws and
reason compositionally about example systems. Finally, we prove that
communicating transactions do not increase the observational power of
processes; thus CCS equivalences are preserved in the extended language.
Sponsor
Grant Number
Science Foundation Ireland (SFI)
SFI 06 IN.1 1898.
Author's Homepage:
http://people.tcd.ie/mcbhennehttp://people.tcd.ie/vkoutav
http://people.tcd.ie/devriee
Description:
PUBLISHEDParis, France
Other Titles:
Lecture Notes in Computer Science21st International Conference on Concurrency Theory (CONCUR 2010)
Publisher:
SpringerType of material:
Conference PaperSeries/Report no:
62692010
Availability:
Full text availableKeywords:
Computer science, language constructDOI:
http://dx.doi.org/10.1007/978-3-642-15375-4_39Licences: