Liveness

In distributed computing, liveness properties informally require that "something good eventually happens" in a distributed system or distributed algorithm (i.e., the system "makes progress").[1][2] A liveness property cannot be violated in a finite execution of a distributed system because the "good" event might only theoretically occur at some time after execution ends. Eventual consistency is an example of a liveness property.[3] All properties can be expressed as the intersection of safety and liveness properties[4] and most non-trivial properties are a mix of the two.

References

  1. ↑ Luís Rodrigues, Christian Cachin; Rachid Guerraoui (2010). Introduction to reliable and secure distributed programming (2. ed. ed.). Berlin: Springer Berlin. pp. 22–24. ISBN 978-3-642-15259-7.
  2. ↑ Lamport, L. (1977). "Proving the Correctness of Multiprocess Programs". IEEE Transactions on Software Engineering (2): 125–143. doi:10.1109/TSE.1977.229904.
  3. ↑ Bailis, P.; Ghodsi, A. (2013). "Eventual Consistency Today: Limitations, Extensions, and Beyond". Queue 11 (3): 20. doi:10.1145/2460276.2462076.
  4. ↑ Alpern, B.; Schneider, F. B. (1987). "Recognizing safety and liveness". Distributed Computing 2 (3): 117. doi:10.1007/BF01782772.

External links