阿贝尔网络I基础和实例
Abelian networks I. Foundations and examples
摘要:
在Deepak Dhar的阿贝尔分布式处理器模型中,自动机占据图的顶点并通过边进行通信。我们证明了两个简单的公理,确保最终的输出不依赖于自动机处理其输入的顺序。服从这些公理的自动机的集合被称为“阿贝尔网络”。我们证明了阿贝尔网络的最小作用量原理。作为一个应用,我们展示了阿贝尔网络如何异步解决某些线性和非线性整数规划。在大多数以前研究的阿贝尔网络中,每个自动机的输入字母表由一个字母组成;相比之下,我们提出了两个非一元的阿贝尔网络的例子:“油和水”和“阿贝尔移动代理”。
英文摘要:
In Deepak Dhar's model of abelian distributed processors, automata occupy the vertices of a graph and communicate via the edges. We show that two simple axioms ensure that the final output does not depend on the order in which the automata process their inputs. A collection of automata obeying these axioms is called an "abelian network". We prove a least action principle for abelian networks. As an application, we show how abelian networks can solve certain linear and nonlinear integer programs asynchronously. In most previously studied abelian networks, the input alphabet of each automaton consists of a single letter; in contrast, we propose two non-unary examples of abelian networks: "oil and water" and "abelian mobile agents".
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。