On Liveness Enforcement of Distributed Petri Net Systems

In this article, we consider the liveness enforcement problem in a class of Petri nets (PNs) modeling distributed systems. They are called synchronized sequential processes. The presented design algorithm is based on the construction of a control PN, an abstraction of the relations of the T-semiflows, and buffers of the original nonstructurally live PN. The control PN evolves in parallel with the system, avoiding the firing of transitions that may lead the system to nonliveness. Four algorithms are presented, one allowing for the computation of the control PN and three ensuring its liveness.