Abstract
This note extends previous results on the supervision of Petri nets (PNs) to the decentralized setting. While focusing on the extension of supervision based on place invariants (SBPI), the proposed approach is more general and could be applied to other types of supervision as well. We begin by introducing d-admissibility as an extension to the decentralized setting of the centralized admissibility concept. We define also structural d-admissibility, as the counterpart of the simple sufficient conditions for centralized admissibility in the context of the SBPI. Note that (structural) d-admissibility is only sufficient for a specification to be enforcible with the same permissiveness as in the centralized setting with full controllability and observability. However, structural d-admissibility can be checked with low polynomial complexity. Based on the d-admissibility concept, we propose two suboptimal methods to design decentralized supervisors. The first method is to find a centralized solution, and then distribute the centralized supervisory policy by means of communication. The amount of communication can be minimized by means of an integer linear program (ILP). The second method is to transform the specification to a (more restrictive) d-admissible specification by means of an ILP. In the case of decentralized supervision with communication, the ILP can be used to minimize the amount of communication required by the solution.
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.