自组装作为图文法作为分布式系统
Self-Assembly as Graph Grammar as Distributed System
摘要：
2004年，Klavins等人引入了使用图语法来描述和编程自组装系统。事实证明，这些图文法是一个“双重概念”的图重写表征的分布式系统，提出了由Degano和Montanari超过20年前。通过应用从这一观察得到的技术，我们证明了一个广义版本的Soloveichik和Winfree的局部决定论定理，我们还提出了一个规范的方法来模拟异步恒定大小的消息传递模型的分布式计算与系统的自组装。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
