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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
