2009/07/06 by Aaron Sterling, Sterling, Aaron
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Cellular Automata and Applications #DNA and Biological Computing #Distributed #F.1.1 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Modular Robots and Swarm Intelligence #Parallel #Robotics (cs.RO) #and Cluster Computing (cs.DC) #cs.DC #cs.FL #cs.RO
paper · pdf · doi:10.48550/arxiv.0907.1072
Withdrawing because I would like to polish this before submitting it publicly again
openalex publication_date 2009/07/06 · 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. We show that these graph grammars can be embedded in a graph rewriting characterization of distributed systems that was proposed by Degano and Montanari over twenty years ago. We apply this embedding to generalize Soloveichik and Winfree's local determinism criterion (for achieving a unique terminal assembly), from assembly systems of 4-sided tiles that embed in the plane, to arbitrary graph assembly systems. We present a partial converse of the embedding result, by providing sufficient conditions under which systems of distributed processors can be simulated by graph assembly systems topologically, in the plane, and in 3-space. We conclude by defining a new complexity measure: "surface cost" (essentially the convex hull of the space inhabited by agents at the conclusion of a self-assembled computation). We show that, for growth-bounded graphs, executing a subroutine to find a Maximum Independent Set only increases the surface cost of a self-assembling computation by a constant factor. We obtain this complexity bound by using the simulation results to import the distributed computing notions of "local synchronizer" and "deterministic coin flipping" into self-assembly.