Extending concurrency models for broadcast, priorities, and signals

Design and formalize extensions of Petri nets, event structures, and higher dimensional automata that natively capture broadcast communication, priority mechanisms, and signaling; and, where possible, prove that the resulting models are fully expressive with respect to these features.

Background

Standard models often cannot encode features (broadcast, priorities, signals) needed to specify liveness-critical systems without fairness. Extending these models would enable structural analysis of justness and support translations from enriched process algebras while preserving liveness guarantees.

References

Open problem 6d Find extensions of the standard models of Petri nets, event structures and higher dimensional automata that capture broadcast communication, priorities and/or signals. If possible, show that the resulting models are “fully expressive” in some sense.

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