Self-Assembly as Graph Grammar as Distributed System

Date
Authors
Sterling, Aaron
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
Comment: 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
Keywords
Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Neural and Evolutionary Computing, F.1.1
Citation
Collections