Axiomatisations and induction principles for justness-preserving equivalences

Develop complete axiomatisations and effective induction principles for semantic equivalences that respect liveness under justness but not fairness, enabling verification of infinite processes without global fairness assumptions.

Background

Standard proof principles such as the Recursive Specification Principle (RSP) and Approximation Induction Principle (AIP) support equivalence-based verification under traditional semantics, but they can become unsound or inapplicable for justness-preserving variants. New laws and proof techniques are required to make equivalence checking practical in the proposed framework.

References

Open Problem Find complete axiomatisations and useful induction principles for suitable equivalences that respect liveness when assuming justness but not fairness.

— Ensuring Liveness Properties of Distributed Systems: Open Problems  (1912.05616 - Glabbeek, 2019) in Task “Complete axiomatisations and induction principles”, Section “A research agenda”