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 finegrain implementation of memories of the past into chemistry.

[1]  Jean-Jacques Lévy,et al.  An Algebraic Interpretation of the lambda beta K-Calculus; and an Application of a Labelled lambda -Calculus , 1976, Theor. Comput. Sci..

[2]  Luca Cardelli.  Strand Algebras for DNA Computing , 2009, DNA.

[3]  D. Gillespie.  Exact Stochastic Simulation of Coupled Chemical Reactions , 1977 .

[4]  Richard J. Lipton,et al.  Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report) , 1976, STOC '76.

[5]  Jens Palsberg,et al.  Complexity Results for 1-Safe Nets , 1993, Theor. Comput. Sci..

[6]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[7]  Ivan Lanese,et al.  Reversing Higher-Order Pi , 2010, CONCUR.

[8]  Erik Winfree,et al.  DNA as a universal substrate for chemical kinetics , 2009, Proceedings of the National Academy of Sciences.

[9]  Luca Cardelli.  Two-domain DNA strand displacement , 2013, Math. Struct. Comput. Sci..

[10]  Iain C. C. Phillips,et al.  Reversing algebraic process calculi , 2007, J. Log. Algebraic Methods Program..

[11]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[12]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[13]  Ilaria Castellani,et al.  Permutation of transitions: An event structure semantics for CCS and SCCS , 1988, REX Workshop.

[14]  Ugo Montanari,et al.  Axiomatizing net computations and processes , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[15]  Irek Ulidowski,et al.  Reversibility and Models for Concurrency , 2007, Electron. Notes Theor. Comput. Sci..

[16]  Luca Cardelli,et al.  A programming language for composable DNA circuits , 2009, Journal of The Royal Society Interface.

[17]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[18]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .