Brief Announcement: Fully Lattice Linear Algorithms.

International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)(2022)

引用 1|浏览5
暂无评分
摘要
This paper focuses on analyzing and differentiating between lattice linear problems and lattice linear algorithms. It introduces a new class of algorithms called (fully) lattice linear algorithms, that induce a partial order among all states and form multiple lattices. An initial state locks the system into one of these lattices. We present a lattice linear self-stabilizing algorithm for minimal dominating set.
更多
查看译文
关键词
Self-stabilization,Lattice linear problems,Lattice linear algorithms,Minimal dominating set,Convergence time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要