计算机集成制造系统 ›› 2016, Vol. 22 ›› Issue (第2期): 465-475.DOI: 10.13196/j.cims.2016.02.019

• 产品创新开发技术 • 上一篇    下一篇

Petri网不可达标识的判定方法研究及其在死锁检测中的应用

鲁法明1,2,曾庆田3+,段华4,彭延军1,包云霞4   

  1. 1.山东科技大学信息科学与工程学院
    2.同济大学嵌入式系统与服务计算教育部重点实验室
    3.山东科技大学电子通信与物理学院
    4.山东科技大学数学与系统科学学院
  • 出版日期:2016-02-29 发布日期:2016-02-29
  • 基金资助:
    国家自然科学基金资助项目(61170079,61202152,61472229,61502279);山东省科技发展资助项目(2014GGX101035,ZR2015FM013);山东省优秀中青年科学家科研奖励基金资助项目(BS2014DX013);同济大学嵌入式系统与服务计算教育部重点实验室开放课题基金资助项目(ESSCKF201403);山东科技大学科研创新团队支持计划与领军人才计划资助项目;山东省高等学校青年骨干教师国内访问学者资助项目。

Decidability method of Petri net non-reachability marks and its application in deadlock detection

  • Online:2016-02-29 Published:2016-02-29
  • Supported by:
    Project supported by the National Natural Science Foundation,China(No.61170079,61202152,61472229,61502279),the S &T Development Fund of Shandong Province,China(No.2014GGX101035,ZR2015FM013),the Scientific Research Award Foundation for Outstanding Young Scientists of Shandong Province,China(No.BS2014DX013),the Open Project Foundation of Key Laboratory of Embedded System and Service Computing,Ministry of Education,Tongji University,China(No.ESSCKF201403),the SDUST Research Fund,China,and the Domestic Visiting Scholars Program for Young Teachers of Shandong Colleges and Universities,China.

摘要: 为进行系统死锁检测,对Petri网特定标识的不可达性判定方法进行研究。对基于虹吸管、陷阱、S-不变量、加模S-不变量等结构特性以及基于状态方程解存在性的不可达标识判定方法进行分析,研究了上述方法可以判定的不可达标识之间的相互关系,建立了Petri网不可达标识的分类体系,为更好地进行标识不可达性判定提供了理论依据。分别结合哲学家就餐问题和一个跨组织协同业务流程Petri网模型的死锁状态,检测说明了标识不可达判定方法的应用。

关键词: Petri网, 可达性分析, 不可达标识分类, 死锁检测

Abstract: To make deadlock detection,the method for non-reachability decidability in specific mark of Petri net was researched.The decision method for non-reachability was analyzed based on solution existence of state equations and structural characteristics such as siphons,traps,S-invariants,modular S-invariants.The relationship of those non-reachable marks which could be decided through different non-reachability analysis method was discussed.A taxonomic hierarchy of Petri net non-reachable marks was established,which provided theoretical support for non-reachability decidability.In addition,the proposed method was applied to detect the deadlock state of two Petri nets which were used to model the dining philosophers problem and a cross-organizational collaborative business processes.

Key words: Petri nets, reachability analysis, non-reachable marks classification, deadlock detection

中图分类号: