...
首页> 外文期刊>International Journal of Control >Distributed computation of supremal conditionally controllable sublanguages
【24h】

Distributed computation of supremal conditionally controllable sublanguages

机译:最高条件可控子语言的分布式计算

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

摘要

In this paper, we further develop the coordination control framework for discrete-event systems with both complete and partial observations. First, a weaker sufficient condition for the computation of the supremal conditionally controllable sublanguage and conditionally normal sublanguage is presented. Then we show that this condition can be imposed by synthesising a-posteriori supervisors. The paper further generalises the previous study by considering general, non-prefix-closed languages. Moreover, we prove that for prefix-closed languages the supremal conditionally controllable sublanguage and conditionally normal sublanguage can always be computed in the distributed way without any restrictive conditions we have used in the past.
机译:在本文中,我们将进一步开发具有完整和部分观测值的离散事件系统的协调控制框架。首先,提出了用于计算最高条件可控子语言和条件正常子语言的较弱的充分条件。然后,我们证明了可以通过合成后验监督者来强加这种情况。本文通过考虑通用的,非前缀封闭的语言来进一步概括先前的研究。此外,我们证明对于前缀封闭的语言,最高的条件可控子语言和条件正常子语言可以始终以分布式方式计算,而没有我们过去使用的任何限制性条件。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号