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. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Lanese, I., Lienhardt, M., Mezzina, C. A., Schmitt, A., & Stefani, J. B. (2013). Concurrent flexible reversibility. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7792 LNCS, pp. 370–390). https://doi.org/10.1007/978-3-642-37036-6_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
