规范变形虫模型：算法与并发控制
The Canonical Amoebot Model: Algorithms and Concurrency Control
AI总结：
提出规范变形虫模型，通过消息传递和对抗性激活模型形式化并发执行，并给出两种并发算法设计方法（直接嵌入并发控制和基于锁的转换框架），以六边形形成算法为例验证。
摘要：
变形虫模型将主动可编程物质抽象为称为变形虫的简单计算元素的集合，这些元素局部交互以共同完成协调和移动任务。自2014年在SPAA上引入以来，越来越多的文献针对各种问题调整了其假设；然而，如果没有标准化的假设层次结构，很难在变形虫模型下对结果进行精确的系统比较。我们提出了规范变形虫模型，这是一种更新的形式化，区分了核心模型特征和假设变体族。规范变形虫模型解决的一个关键改进是并发性。现有文献大多隐含地假设变形虫的动作是隔离且可靠的，将分析简化为至多一个变形虫同时活动的顺序设置。然而，真实的可编程物质系统是并发的。规范变形虫模型将所有变形虫通信形式化为消息传递，利用并发执行的对抗性激活模型。在这种对时间的精细处理下，我们采用了两种互补的方法来设计并发算法。我们首先建立了一组在任何并发执行下算法正确性的充分条件，将并发控制直接嵌入算法设计。然后，我们提出了一个使用锁的并发控制框架，将在顺序设置中终止并满足特定约定的变形虫算法转换为在并发设置中表现出等效行为的算法。作为案例研究，我们使用一个简单的六边形形成算法演示了这两种方法。规范变形虫模型和这些互补的并发算法设计方法共同为可编程物质的分布式计算研究开辟了新的方向。
英文摘要：
The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks of coordination and movement. Since its introduction at SPAA 2014, a growing body of literature has adapted its assumptions for a variety of problems; however, without a standardized hierarchy of assumptions, precise systematic comparison of results under the amoebot model is difficult. We propose the canonical amoebot model, an updated formalization that distinguishes between core model features and families of assumption variants. A key improvement addressed by the canonical amoebot model is concurrency. Much of the existing literature implicitly assumes amoebot actions are isolated and reliable, reducing analysis to the sequential setting where at most one amoebot is active at a time. However, real programmable matter systems are concurrent. The canonical amoebot model formalizes all amoebot communication as message passing, leveraging adversarial activation models of concurrent executions. Under this granular treatment of time, we take two complementary approaches to concurrent algorithm design. We first establish a set of sufficient conditions for algorithm correctness under any concurrent execution, embedding concurrency control directly in algorithm design. We then present a concurrency control framework that uses locks to convert amoebot algorithms that terminate in the sequential setting and satisfy certain conventions into algorithms that exhibit equivalent behavior in the concurrent setting. As a case study, we demonstrate both approaches using a simple algorithm for hexagon formation. Together, the canonical amoebot model and these complementary approaches to concurrent algorithm design open new directions for distributed computing research on programmable matter.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
