Self-Assembly as Graph Grammar as Distributed System

Details Self-Assembly as Graph Grammar as Distributed System Self-Assembly as Graph Grammar as Distributed System

2009-02-14

arxiv.org/abs/0902.2420v3

Computer Science

Distributed, Parallel, and Cluster Computing

Withdrawn as I would like to polish it before making it public again. A two-page announcement of these results will appear in

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Self-Assembly as Graph Grammar as Distributed System does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-Assembly as Graph Grammar as Distributed System, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Assembly as Graph Grammar as Distributed System will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55050