Consistency of Petri net justness with process-algebra justness

Determine whether the structural characterization of justness for Petri nets coincides with the characterizations of justness developed for process algebras (such as CCS and its extensions), by comparing the sets of just runs obtained via the standard Petri net semantics and the component-labelled transition system semantics.

Background

Petri nets offer a structural notion of justness (a transition eventually fires if enabled and non-competing tokens are not consumed), while process algebras use component-labelled transition systems and concurrency relations. Ensuring these notions align is critical for cross-model reasoning and for translating specifications between algebras and Petri nets without altering liveness guarantees.

References

Open Problem Is the structural characterisation of justness from Petri nets consistent with the characterisations of justness for process algebras from ?

— Ensuring Liveness Properties of Distributed Systems: Open Problems  (1912.05616 - Glabbeek, 2019) in Task “Petri nets and other semantic models”, Section “A research agenda”