Abstract

Proves a reduction theorem for the supervisory control of general controlled Petri nets, with general legal sets. The reduction theorem shows that in order to design a maximally permissive control law guaranteeing that the marking always remains in the legal set, it is sufficient to consider a sub-Petri net of the full model. This extends the design algorithms which were previously known for special classes of Petri nets, and for special classes of legal sets. The reduction theorem allows us to prove a useful property of maximally permissive control laws, and to limit the number of events which must be observed.

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

Disclaimer: 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.