Reversing a (forward) computation history means undoing the history. In
concurrent systems, undoing the history is not performed in a deterministic way
but in a causally consistent fashion, where states that are reached during a
backward computation are states that could have been reached during the
computation history by just performing independent actions in a different
order.Comment: Presented at MeCBIC 201

Cardelli, Luca

Laneve, Cosimo

Scientific Annals of Computer Science

English

arXiv

We introduce reversible structures, an algebra for massive concurrent systems, where terms retain bits of causal dependencies that allow one to reverse computation histories. We then study the implementation of (weak coherent) reversible structures in three-domains DNA strands, which is the natural model that has inspired reversible structures. We finally provide schemas for modeling significant synchronization patterns of process algebra into reversible structures and discuss the encoding of asynchronous Reversible CCS

L. Cardelli

C. Laneve

Directory of Open Access Journals

Reversibility in Massive Concurrent Systems

Reversibility in Massive Concurrent System

Luca Cardelli

LANEVE, COSIMO

Archivio istituzionale della ricerca - Alma Mater Studiorum Università di Bologna

http://www.info.uaic.ro/bin/download/Annals/XXI2/XXI2_0.pdf

Reversibility in Massive Concurrent Systems

Abstract

Similar works

Full text

Available Versions

Directory of Open Access Journals

Archivio istituzionale della ricerca - Alma Mater Studiorum Università di Bologna