Self assembling graphs

Authors:
Vincent Danos;Fabien Tarissan
Affiliations:
Équipe PPS, CNRS & Université Paris VII;Équipe PPS, Université Paris VII
Venue:
IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I
Year:
2005

Citing 5
Cited 2

Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Programmable self-assembly using biologically-inspired multiagent control

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Formal molecular biology

Theoretical Computer Science - Special issue: Computational systems biology
Core formal molecular biology

ESOP'03 Proceedings of the 12th European conference on Programming

Self-assembling Trees

Electronic Notes in Theoretical Computer Science (ENTCS)
Self-assembling graphs

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

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.