Self Assembling Graphs

A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process algebra, extends Klavins' original proposal [1], in that it relies only on point-to-point communication, and can deal with any assembly graph whereas Klavins' method dealt only with trees.

[1]  Cosimo Laneve,et al.  Core Formal Molecular Biology , 2003, ESOP.

[2]  Vincent Danos,et al.  Self-assembling graphs , 2006, Natural Computing.

[3]  Vincent Danos,et al.  Self-assembling Trees , 2007, Electron. Notes Theor. Comput. Sci..

[4]  Jeff Hasty,et al.  Engineered gene circuits , 2002, Nature.

[5]  Cosimo Laneve,et al.  Formal molecular biology , 2004, Theor. Comput. Sci..

[6]  Eric Klavins,et al.  Automatic synthesis of controllers for distributed assembly and formation forming , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[7]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[8]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[9]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[10]  Radhika Nagpal,et al.  Programmable self-assembly using biologically-inspired multiagent control , 2002, AAMAS '02.