...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Automatic Control >On supervisory policies that enforce liveness in a class ofcompletely controlled Petri nets obtained via refinement
【24h】

On supervisory policies that enforce liveness in a class ofcompletely controlled Petri nets obtained via refinement

机译：关于通过细化获得的一类完全受控的Petri网中强制执行活动的监管政策

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The authors consider Petri nets (PNs), where each transition can be prevented from firing by an external agent, the supervisor. A PN is said to be live if it is possible to fire any transition from every reachable marking, although not necessarily immediately. The procedure proposed previously by the author (1996) involves the construction of the coverability graph, which can be computationally expensive. Using the refinement/abstraction procedure of Suzuki and Murata (1983), where a single transition in a abstracted PN N is replaced by a PN N? to yield a larger refined PN N?, we show that when N? belongs to a class of marked-graph PNs, there is a supervisory policy that enforces liveness in the refined PN N? if and only if there is a similar policy for the abstracted PN N. Since the coverability graph of the PN N is smaller than that of the PN N?, it is possible to achieve significant computational savings by using the process of abstraction on N?. This is illustrated by example
机译：作者考虑了Petri网（PN），在这种情况下，可以防止外部代理（主管）触发每次过渡。如果有可能从每个可到达的标记发射任何过渡信号，尽管不一定立即触发，那么PN就是有生命的。作者先前提出的程序（1996年）涉及可覆盖性图的构建，其计算量可能很大。使用Suzuki和Murata（1983）的细化/抽象过程，其中抽象PN N中的单个过渡被PN N取代。产生更大的精制PN N ?，我们证明当N？属于标记图PN的一类，是否有一种监管策略可以在经过精炼的PN N中强制执行活动？由于且仅当对抽象的PN N有类似的策略时，由于PN N的可覆盖性图小于PN N2的可覆盖性图，因此可以通过使用对N？的抽象过程来节省大量计算量。 。举例说明

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号