Abelian networks II: halting on all inputs

Selecta Mathematica(2015)

引用 10|浏览5
暂无评分
摘要
Abelian networks are systems of communicating automata satisfying a local commutativity condition. We show that a finite irreducible abelian network halts on all inputs if and only if all eigenvalues of its production matrix lie in the open unit disk.
更多
查看译文
关键词
Abelian distributed processors,Asynchronous computation,Automata network,Chip firing,Commutative monoid action,Dickson's lemma,Least action principle,M-matrix,Sandpile,Torsor
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要