|
Communicating Transactions |
HENNESSY, MATTHEW; DE VRIES, EDSKO; KOUTAVAS, VASILEIOS
|
|
|
|
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.
|
|
Keyword(s):
|
Computer science; language construct |
Publication Date:
|
2010 |
|
Type:
|
Conference item |
|
Peer-Reviewed:
|
Yes |
|
Language(s):
|
English |
|
Institution:
|
Trinity College Dublin |
|
Citation(s):
|
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 |
|
Publisher(s):
|
Springer |
|
Alternative Title(s):
|
Lecture Notes in Computer Science -21st International Conference on Concurrency Theory (CONCUR 2010) |
|
First Indexed:
2014-05-13 05:44:07 Last Updated:
2015-07-15 05:20:55 |
