Concurrent reversibility has been studied in different areas, such as biological or dependable distributed systems. However, only “rigid” reversibility has been considered, allowing to go back to a past state and restart the exact same computation, possibly leading to divergence. In this paper, we present croll-π, a concurrent calculus featuring flexible reversibility, allowing the specification of alternatives to a computation to be used upon rollback. Alternatives in croll-π are attached to messages. We show the robustness of this mechanism by encoding more complex idioms for specifying flexible reversibility, and we illustrate the benefits of our approach by encoding a calculus of communicating transactions.
Concurrent Flexible Reversibility / Ivan Lanese;Michael Lienhardt;Claudio Antares Mezzina;Alan Schmitt;Jean-Bernard Stefani. - STAMPA. - 7792:(2013), pp. 370-390. (Intervento presentato al convegno 22nd European Symposium on Programming tenutosi a Roma nel 16-24/3/2013) [10.1007/978-3-642-37036-6_21].
Concurrent Flexible Reversibility
LANESE, IVAN;LIENHARDT, MICHAEL;
2013
Abstract
Concurrent reversibility has been studied in different areas, such as biological or dependable distributed systems. However, only “rigid” reversibility has been considered, allowing to go back to a past state and restart the exact same computation, possibly leading to divergence. In this paper, we present croll-π, a concurrent calculus featuring flexible reversibility, allowing the specification of alternatives to a computation to be used upon rollback. Alternatives in croll-π are attached to messages. We show the robustness of this mechanism by encoding more complex idioms for specifying flexible reversibility, and we illustrate the benefits of our approach by encoding a calculus of communicating transactions.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
