• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Advances in Big Data, Computing and Data Communication Systems >‘Firing Sequence’ as a Tool for the Analysis of Petri Nets
【24h】

‘Firing Sequence’ as a Tool for the Analysis of Petri Nets

机译：'射击序列'作为分析Petri网的工具

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

摘要

In this paper, a new tool is known as the `firing sequence' is introduced for the analysis of Petri nets. Firing sequence is proposed as a supplement to the well-known `reachability tree.' Firing sequence is implemented in the General-purpose Petri net Simulator (GPenSIM). For analyzing Petri nets, this paper proposes performing the analysis with the reachability tree as a starting point. If the reachability tree indicates any deadlocks, then firing sequence can be used to verify the possibility of getting into the deadlock state. By using the firing sequence, the firing conditions (the external variables) can also be taken into account, which is not possible with the reachability tree. Also, the firing sequence incorporates firing times of the transitions, thus provides the time perspective in the analysis, which is also not possible in the reachability tree analysis.
机译：在本文中，引入了一种新工具，被称为用于分析Petri网的“射击序列”。提出烧制序列作为众所周知的“可达性树的补充。”射击序列是在通用Petri网模拟器（GPensim）中实现的。为了分析Petri网，本文提出使用可达性树作为起点进行分析。如果可达性树指示任何死锁，则可以使用触发序列来验证进入死锁状态的可能性。通过使用触发序列，也可以考虑触发条件（外部变量），即可使用可达性树是不可能的。此外，烧制序列包含转变的烧制时间，从而提供了分析中的时间透视图，即在可达性树分析中也是不可能的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号