Reversible structures

Reversible structures are computational units that may progress forward and backward. We study weak coherent structures that are primarily inspired by dna circuits and may be compiled in these systems and demonstrate a standardization theorem. When units have unique id, the standardization theorem may be strengthened in a form that bears a quadratic algorithm for reachability, a problem that is expspace-complete for generic structures. We then define a compilation of a concurrent calculus – the asynchronous rccs – to dna via reversible structures, thus yielding a fine-grain implementation of memories of the past into chemistry.

• Type: Journal
• Year: 2011
• Where: CMSB
• Authors: Luca Cardelli, Cosimo Laneve
• Keywords: Applied Computing, CMSB 2011, Generic Structures, Quadratic Algorithm, Standardization Theorem