Abstract
This paper presents the formulation of a class of forbidden state problems for controlled Petri nets (CPN's). A dynamic programming algorithm for computing the maximum of tokens in some place is developed. We show that this algorithm can be used to synthesize maximally permissive feedback policy for the forbidden state problems. Our method not only applies to a larger class of CPN' s but also applies to a larger class of forbidden state problems for the same class of CPN' s than the existing state avoidance schemes.
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.
