Justness for process algebras with priorities

Formally define justness for process algebras whose operational semantics include a priority mechanism, specifying which executions (runs) are deemed just in the presence of prioritized actions.

Background

The paper argues that liveness properties should be established under a global justness assumption without relying on fairness. While justness has been defined for mainstream process algebras (e.g., CCS and variants), the authors note a gap for algebras equipped with priority mechanisms. Priority alters which actions can occur and potentially affects which runs should be considered just, making a precise formal definition essential for applying the proposed framework to such languages.

References

For some less usual process algebras it is not yet clear how to formalise the concept of justness. This applies in particular to process algebras with a priority mechanism .

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