Choreographies for Automatic Recovery
Logic in Computer Science
2017-05-29 v1 Formal Languages and Automata Theory
Abstract
We propose a choreographic model of reversible computations based on a conservative extension of global graphs and communicating finite-state machines. The main advantage of our approach is that does not require to instrument models in order to control reversibility but for a minor decoration of branches. We show that our models are conservative extensions of existing ones and that the reversible semantics guarantees causal consistency.
Cite
@article{arxiv.1705.09525,
title = {Choreographies for Automatic Recovery},
author = {Claudio Antares Mezzina and Emilio Tuosto},
journal= {arXiv preprint arXiv:1705.09525},
year = {2017}
}