Item Type:Conference Paper
Citation: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-583
Communicating.pdf (Published (author's copy) - Peer Reviewed) 412.4Kb
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.
Science Foundation Ireland (SFI)
SFI 06 IN.1 1898.
Other Titles:Lecture Notes in Computer Science
21st International Conference on Concurrency Theory (CONCUR 2010)
Type of material:Conference Paper
Availability:Full text available