Semantic equivalences respecting liveness under justness

Identify and classify semantic equivalences and preorders on models of concurrency that preserve liveness properties when assuming justness but not fairness, providing a basis for specification–implementation verification without relying on global fairness assumptions.

Background

Existing equivalences typically identify strongly bisimilar systems, yet the paper exhibits bisimilar programs that differ in crucial liveness properties under justness. Therefore, finer or incomparable semantic notions are needed to validate liveness without fairness and to support verification methodologies that avoid unsound fair-abstraction steps.

References

Open Problem Find and classify suitable semantic equivalences that respect liveness when assuming justness but not fairness.

— Ensuring Liveness Properties of Distributed Systems: Open Problems  (1912.05616 - Glabbeek, 2019) in Task “A classification of semantic equivalences and preorders”, Section “A research agenda”