Axiomatizing net computations and processes
Proceedings of the Fourth Annual Symposium on Logic in computer science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Permutation of transitions: An event structure semantics for CCS and SCCS
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Reversibility and Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical reversibility of computation
IBM Journal of Research and Development
Strand Algebras for DNA Computing
DNA Computing and Molecular Programming
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Concurrent flexible reversibility
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Modelling of bonding with processes and events
RC'13 Proceedings of the 5th international conference on Reversible Computation
Reversibility and asymmetric conflict in event structures
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
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.