Byzantine Generalized Lattice Agreement
The paper investigates the Lattice Agreement (LA) problem in asynchronous systems. In LA each process proposes an element e from a predetermined lattice, and has to decide on an element e′ of the lattice such that e ≤ e′. Moreover, decisions of different processes have to be comparable (no two processes can decide two elements e′ and e such that (e ≰ e′) ∧ (e′ ≰ e)).It has been shown that Generalized LA (i.e., a version of LA proposing and deciding on sequences of values) can be used to build a Replicated State Machine (RSM) with commutative update operations.