• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IFAC PapersOnLine >A Reduced Computation of State Space to Enforce GMECs and Deadlock-Freeness on TPN Systems ?
【24h】

A Reduced Computation of State Space to Enforce GMECs and Deadlock-Freeness on TPN Systems ?

机译：在TPN系统上缩短了对状态空间的计算和DECORCLE-FREENESS ？

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper analyzes the enforcement of Generalized Mutual Exclusion Constraints (GMECs) and deadlock-freeness on a Time Petri net (TPN) system with uncontrollable transitions, motivated by the fact that the existing methods enforcing GMECs may degrade the performance of a closed-loop system and lead to deadlock states. By exploiting timing information and mathematical programming, a control function is designed to restrict the firing intervals of transitions such that a TPN system can avoid entering forbidden states. The key idea behind the proposed approach is the online computation of a graph, called Reduced Modified State Class Graph, that is derived from another graph recently presented in the literature.
机译：本文分析了一段普遍的互排除约束（GMEC）和死锁-Freeness在具有无法控制的过渡的时间的普遍的互斥约束和死锁 - Freeness，这是由执行GmeC的现有方法可能降低闭环系统的性能的影响。并导致死锁状态。通过利用定时信息和数学编程，控制功能旨在限制转换的发射间隔，使得TPN系统可以避免进入禁止的状态。所提出的方法背后的关键思想是图表的在线计算，称为减少的修改状态类图，该图是从文献中呈现的另一图。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号