Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Extending Lattice linearity for Self-Stabilizing Algorithms   In this article, we focus on extending the notion of lattice linearity to
self-stabilizing programs. Lattice linearity allows a node to execute its
actions with old information about the state of other nodes and still preserve
correctness. It increases the concurrency of the program execution by
eliminating the need for synchronization among its nodes. The extension --
denoted as eventually lattice linear algorithms -- is performed with an example
of the service-demand based minimal dominating set (SDDS) problem, which is a
generalization of the dominating set problem; it converges in $2n$ moves.
Subsequently, we also show that the same approach could be used in various
other problems including minimal vertex cover, maximal independent set and
graph coloring.

28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
5
The categories of this paper are: gr-qc
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat
2
The categories of this paper are: math
0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
10
The categories of this paper are: q-bio
31
The categories of this paper are: ao-sci