2009/02/14 by Aaron Sterling, Sterling, Aaron
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Advanced biosensing and bioanalysis techniques #DNA and Biological Computing #Distributed #F.1.1 #FOS: Computer and information sciences #Modular Robots and Swarm Intelligence #Neural and Evolutionary Computing (cs.NE) #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.NE
paper · pdf · doi:10.48550/arxiv.0902.2420
Withdrawn as I would like to polish it before making it public again. A two-page announcement of these results will appear in the proceedings of PODC 2009
openalex publication_date 2009/02/14 · arxiv created 2011/07/20 · arxiv updated 2011/07/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. It turns out that these graph grammars are a "dual notion" of a graph rewriting characterization of distributed systems that was proposed by Degano and Montanari over twenty years ago. By applying techniques obtained from this observation, we prove a generalized version of Soloveichik and Winfree's theorem on local determinism, and we also present a canonical method to simulate asynchronous constant-size-message-passing models of distributed computing with systems of self-assembly.