Expressiveness comparison for mutual exclusion

Compare the relative expressive power of process algebras that can accurately specify mutual exclusion protocols without global fairness assumptions, by establishing valid encodings or separation results among these languages.

Background

The paper discusses that CCS and basic Petri nets cannot specify fair schedulers or mutual exclusion correctly without fairness, whereas certain extensions (e.g., non-blocking reading, broadcast, priorities, signals) can. A systematic comparison is needed to understand and justify language choices when fairness is avoided.

References

Open problem 6a Compare the relative expressiveness of the process algebras that can capture mutual exclusion.

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