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. |
Year | Venue | Field |
---|---|---|
2017 | arXiv: Logic in Computer Science | Causal consistency,Graph,Algorithm,Theoretical computer science,Conservative extension,Semantics,Mathematics,Computation |
DocType | Volume | Citations |
Journal | abs/1705.09525 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Claudio Antares Mezzina | 1 | 0 | 1.35 |
Emilio Tuosto | 2 | 499 | 42.62 |