Maximally Permissive Mutually & Globally Nonblocking Supervision with Application to Switching Control

A supervisor is said to be mutually nonblocking with respect to a pair of specifications if upon completing a task in any of the specifications, it can continue on to complete the task in the other specification, i.e., the two specifications do not block each other. The notion of mutually nonblocking supervisor was introduced in Fabian and Kumar [2000. Automatica, 36(12), 1863-1869]. In this paper, we present an algorithm of polynomial complexity for computing a maximally permissive mutually and globally nonblocking supervisor. In case such a supervisor does not exist, we present a technique for relaxing the specifications for which a supervisor exists. The algorithms are based on a notion of attractability, and as a special case offer a new way of computing the maximally permissive nonblocking supervisors. The results are then applied to design of maximally permissive switching supervisors so as to allow for switching between the specifications at any time while the system is executing. \ua9 2005 Elsevier Ltd. All rights reserved