A unifying simple process algebra preserving justness and bisimilarity

Construct a simple process algebra (in the style of Meije) into which all common process algebras can be translated via encodings that preserve strong bisimilarity and liveness properties under justness without fairness.

Background

A unifying target language would facilitate cross-language verification under justness by providing a common semantic substrate. Unlike classical unifying results that rely on standard bisimulation alone, the encodings must also preserve liveness under justness, avoiding fair-abstraction artifacts.

References

Open problem 6c Find a simple process algebra in the style of {\sc Meije} such that all common process algebras can be translated in to it, where the translation preserves strong bisimilarity as well as liveness properties when assuming justness but not fairness.

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