Maximally permissive mutually and globally nonblocking supervision with application to switching control
Maximally permissive mutually and globally nonblocking supervision with application to switching control
复制标题
DOI：
10.1016/j.automatica.2005.03.011
复制
发表时间：
2005-08
期刊：
影响因子：
--
通讯作者：
Ratnesh Kumar;S. Takai;Martin Fabian;T. Ushio
中科院分区：
文献类型：
--
作者：
Ratnesh Kumar;S. Takai;Martin Fabian;T. Ushio
如果在完成任何一个规范中的任务后，它可以继续完成另一个规范中的任务，即两个规范不相互阻塞，则称为主管对一对规范是相互不阻塞的。相互非阻塞监事的概念由Fabian和Kumar[2000]提出。自动化，36(12),1863-1869。本文给出了一种多项式复杂度的计算最大允许全局互非阻塞监督器的算法。如果这样的主管不存在，我们提出了一种技术来放松主管存在的规范。该算法基于吸引力的概念，并作为一种特殊情况，提供了一种计算最大允许的非阻塞监督器的新方法。然后将结果应用于最大允许切换管理器的设计，以便在系统执行时随时允许在规格之间切换。
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.