• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Symposium on Mathematical Foundations of Computer Science >A Reachability Algorithm for General Petri Nets Based on Transition Invariants
【24h】

A Reachability Algorithm for General Petri Nets Based on Transition Invariants

机译：基于转换不变的Petri网的可达性算法

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

摘要

A new reachability algorithm for general Petri nets is proposed. Given a Petri net with an initial and a target markings, a so called complemented Petri net is created first that consists of the given Petri net and an additional, complementary transition. Thereby, the reachability task is reduced to calculation and investigation of transition invariants (T-invariants) of the complemented Petri net. The algorithm finds all minimal-support T-invariants of the complemented Petri net and then calculates a finite set of linear combinations of minimal-support T-invariants, in which the complementary transition fires only once. Finally, for each T-invariant with a single firing of the complementary transition, the algorithm tries to create a reachability path from initial to target marking or determines that there is no such path.
机译：提出了一般培养网的新可达性算法。鉴于具有初始和目标标记的Petri网，首先创建所谓的补充Petri网，其中包括给定的Petri网和额外的补充过渡。因此，可达性任务减少到补充培养网的转换不变量（T-Fonoriants）的计算和调查。该算法查找补充的Petri网的所有最小支持T-Funiants，然后计算最小支持T-Invariants的有限线性组合，其中互补过渡仅触发一次。最后，对于具有单一射击的互补转换的每个T-Inviant，算法尝试从初始到目标标记的可达性路径，或者确定没有这样的路径。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号