...
首页> 外文期刊>IEEE Transactions on Automatic Control >Synthesis of Maximally-Permissive Supervisors for the Range Control Problem
【24h】

Synthesis of Maximally-Permissive Supervisors for the Range Control Problem

机译:范围控制问题的最大允许监督者的综合

获取原文
获取原文并翻译 | 示例
           

摘要

We investigate the supervisor synthesis problem for centralized partially-observed discrete event systems subject to safety specifications. It is well known that this problem does not have a unique supremal solution in general. Instead, there may be several incomparable locally maximal solutions. One then needs a mechanism to select one locally maximal solution. Our approach in this paper is to consider a lower bound specification on the controlled behavior, in addition to the upper bound for the safety specification. This leads to a generalized supervisory control problem called the range control problem. While the upper bound captures the (prefix-closed) legal behavior, the lower bound captures the (prefix-closed) minimum required behavior. We provide a synthesis algorithm that solves this problem by effectively constructing a maximally-permissive safe supervisor that contains the required lower bound behavior. This is the first algorithm with such properties, as previous works solve either the maximally-permissive safety problem (with no lower bound), or the lower bound containment problem (without maximal permissiveness).
机译:我们调查受安全规范约束的集中式部分观测离散事件系统的主管综合问题。众所周知,此问题通常没有唯一的最高解决方案。相反,可能存在几种无法比拟的局部最大解。然后,需要一种机制来选择一个局部最大解。我们在本文中的方法是,除了安全规范的上限外,还要考虑受控行为的下限规范。这导致了广义的监督控制问题,称为范围控制问题。上限捕获(前缀关闭)合法行为,而下限捕获(前缀关闭)最小必需行为。我们提供了一种综合算法,可以通过有效构造包含所需下限行为的最大允许安全监控器来解决此问题。这是具有这种特性的第一个算法,因为先前的工作解决了最大允许的安全性问题(无下限)或下限约束问题(无最大允许性)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号