Distributed Computation of Liveness-Enforcing Supervisory Control of Flexible Manufacturing Systems

Abstract

This paper presents a modular deadlock prevention policy for large-scale flexible manufacturing systems. It can find maximally permissive liveness-enforcing supervisory control in an efficient computational complexity manner. A vector covering approach is used to minimize essential set of legal markings and first-met bad markings. Providing that modules of system interact using choice, we will prove that monitor-based supervisory control methods can be applied distributedly. Then, choice operator of Petri net will be used to synthesis subsystems. Even if such assumption limits the application of modular monitor-based supervisory control, the proposed results constitute a primary step towards a synthesis procedure that overcomes time and space complexity of monitor-based deadlock prevention policies.