Abstract
Traditional maximally permissive deadlock prevention control for flexible manufacturing systems requires costly reachability analysis. It has been a hot race to synthesise optimal controllers to be maximally permissive with fewest monitors. Previous work shows that among all n -dependent siphons, only one siphon (whose unmarked state follows some token distribution) needs to be controlled. This greatly simplifies the supervisor synthesis as well as minimises the number of monitors required while making the controlled net maximally permissive (i.e. all live states can be reached.). This study further proposes a maximally permissive control policy for a subclass of systems of simple sequential processes with resources (S 3 PR) based on the above theory of token distribution pattern of unmarked siphons.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.