Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

IWINAC
2005
Springer

favoriteEmaildiscussreport

84views Artificial Intelligence» more IWINAC 2005»

Self Assembling Graphs

14 years 4 months ago

Self Assembling Graphs

Download www.pps.jussieu.fr

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.

Vincent Danos, Fabien Tarissan

Real-time Traffic

Hoc Rule-based Process | IWINAC 2005 | Particular Graph | Self-assembly Algorithm |

claim paper

Related Content

» Brief announcement selfassembly as graph grammar as distributed system

» Optimal distributed planning for self assembly of modular manipulators

» Automatic Synthesis of Controllers for Distributed Assembly and Formation Forming

» Triangular SelfAssembly

» Designing SelfOrganization for Evolvable Assembly Systems

» Communication convergence and stochastic stability in selfassembly

» Simulation of SelfAssembly in the Abstract Tile Assembly Model with ISU TAS

» SelfAssembly of Infinite Structures

» Intrinsic Universality in SelfAssembly

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	IWINAC
Authors	Vincent Danos, Fabien Tarissan

Comments (0)