Fully Lattice Linear Algorithms

This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called $\mathit{\text{(fully)}}\mathit{\text{lattice}}\mathit{\text{linear}}\mathit{\text{algorithms}}$. A property of these algorithms is that they induce a partial order among all states and form $\mathit{\text{multiple}}\mathit{\text{lattices}}$. An initial state locks in one of these lattices. We present a lattice linear self-stabilizing algorithm for minimal dominating set.