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.
@article{arxiv.0902.2420,
title = {Self-Assembly as Graph Grammar as Distributed System},
author = {Aaron Sterling},
journal= {arXiv preprint arXiv:0902.2420},
year = {2011}
}
Comments
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