Reversible structures
- 21 September 2011
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 131-140
- https://doi.org/10.1145/2037509.2037529
Abstract
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 finegrain implementation of memories of the past into chemistry.Keywords
This publication has 14 references indexed in Scilit:
- Two-Domain DNA Strand DisplacementElectronic Proceedings in Theoretical Computer Science, 2010
- DNA as a universal substrate for chemical kineticsProceedings of the National Academy of Sciences of the United States of America, 2010
- A programming language for composable DNA circuitsJournal of The Royal Society Interface, 2009
- Reversibility and Models for ConcurrencyElectronic Notes in Theoretical Computer Science, 2007
- Reversing algebraic process calculiThe Journal of Logic and Algebraic Programming, 2007
- Reversible Communicating SystemsLecture Notes in Computer Science, 2004
- Permutation of transitions: An event structure semantics for CCS and SCCSLecture Notes in Computer Science, 1989
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- Exact stochastic simulation of coupled chemical reactionsThe Journal of Physical Chemistry, 1977
- An algebraic interpretation of the λβK-calculus; and an application of a labelled λ-calculusTheoretical Computer Science, 1976