Self Assembling Graphs

Vincent Danos, Fabien Tarissan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
Original languageEnglish
Title of host publicationMechanisms, Symbols, and Models Underlying Cognition
Subtitle of host publicationFirst International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June 15-18, 2005, Proceedings, Part I
EditorsJosé Mira, JoséR. Álvarez
PublisherSpringer Berlin Heidelberg
Pages498-507
Number of pages10
Volume3561
ISBN (Electronic)978-3-540-31672-5
ISBN (Print)978-3-540-26298-5
DOIs
Publication statusPublished - 2005

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume3561

Fingerprint

Dive into the research topics of 'Self Assembling Graphs'. Together they form a unique fingerprint.

Cite this