Abstract
In this paper, we consider the liveness enforcement problem in a class of Petri nets (PN) modeling distributed systems. They are called <i>synchronized sequential processes</i> (SSP). 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 <i>control PN</i> evolves in parallel with the system, avoiding the firing of transitions that may lead the system to non liveness. Four algorithms are presented, one allowing for the computation of the control PN and three ensuring its liveness.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
