Brief announcement: self-assembly as graph grammar as distributed system

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 can be embedded in 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. We also obtain a canonical method to simulate asynchronous constant-size-messagepassing models of distributed computing with systems of self-assembly. Categories and Subject Descriptors putation by Abstract Devices]: Models of Computation--Relation between models General Terms Theory Keywords Self-Assembly, Graph Grammar, Graph Assembly System, Grammars for Distributed Systems

• Type: Conference
• Year: 2009
• Where: PODC
• Authors: Aaron Sterling
• Keywords: Graph Assembly System, Graph Grammars, Graph Rewriting Characterization, Parallel Computing, PODC 2009