期刊文献+

基于极小T-不变量增加的Petri网可达性分析 被引量:6

Reachability analysis of Petri nets based on minimal T-invariant adding
下载PDF
导出
摘要 基于极小T-不变量增加的Petri网的可达性分析,首先对网的状态方程加以合理的约束,求得一组特征解向量;然后利用扩展极小T-不变量关系图和扩展借矩阵在这些特征解向量的基础上适当添加整数倍的极小T-不变量;最后再判断这个添加极小T-不变量后的解向量的可达性。该方法不仅能判定一类含T-不变量Petri网的可达性,而且能在可达的情况下求得一个合法的变迁发生序列,并在一定程度上简化了可达性分析的过程。 The reachability problem of a class of Petri nets can be solved by a method based on minimal T-invariant adding. This approach first gave some reasonable constraint conditions to the fundamental equation of the net,and then obtained some characteristic vectors to solve the linear constrained problem. After that,added some properly minimal T-invariants to the characteristic vectors by using an extended relation graph of minimal T-invariants and an extended borrowing matrix. Finally it was determined whether or not the consequent vector can be transformed to a target state. This method can not only decide whether the target state is reachable,but also find a legal firing transition sequence leading to that state,and make the determination very simple.
作者 彭建兵 焦莉
出处 《计算机应用研究》 CSCD 北大核心 2010年第10期3798-3802,共5页 Application Research of Computers
关键词 PETRI网 可达性 极小T-不变量 极小T-不变量关系图 扩展极小T-不变量关系图 借矩阵 扩展借矩阵 Petri net reachability minimal T-invariant relation graph of minimal T-invariants extended relation graph of minimal T-invariants borrowing matrix extended borrowing matrix
  • 相关文献

参考文献9

  • 1MURATA T. Petri nets : properties, analysis and application [ J ]. Proceedings of the IEEE, 1989, 77(4) :541-580.
  • 2DESEL J. Basic linear algebraic techniques for place/transition nets [ C ]//Lectures on Petri Nets Ⅰ: Basic Models. Berlin: Springer, 1998 : 257- 308.
  • 3DESEL J, REISIG W.Place/transition Petri nets[ C]//Lectures on Petri Nets Ⅰ: Basic Models, Advances in Petri Nets, the Volums are based on Advanced Course on PetriNets. Berlin: Springer, 1998: 122- 173.
  • 4KOSTIN A E. Using transition invariants for reachability analysis of Petri nets[ M ]//Petri Net: Theory and Application. [ S. l. ] : I-Tech Education and Publishing, 2008: 433-458.
  • 5于枫,罗军舟,李伟.基于T-不变量消除的Petri网合法变迁引发序列判定算法[J].解放军理工大学学报(自然科学版),2008,9(5):522-527. 被引量:5
  • 6KOSTIN A E. Reachability analysis in T-invariant-less Petri nets[J]. IEEE Trans on Automatic Control, 200i, 48(6) :1019-1024.
  • 7KRUCKEBERG F, JAXY M. Mathematical methods for calculating invariants in Petri nets[ C ]//Proc of the 7th European Workshop on Applications and Theory of PetriNets. Berlin: Springer, 1987: 104- 131.
  • 8GIRAULT C,VALK R.系统工程Petri网[M].王生原,余鹏,霍金键,译.北京:电子工业出版社,2005.
  • 9ROCH S, STARKE P H. INA: integrated net analyzer, version 2.2 [ CP]. Berlin: Humboldt Universitat zu Berlin, 2001.

二级参考文献11

  • 1MURATA T. Petri nets : properties, analysis and applications[J]. Proc of the IEEE, 1989, 77 (4): 541- 580.
  • 2WATANABE T. The legal firing sequence problem of petri nets[J]. IEICE Trans. on Information and Systems, 2000,E83D(3) : 397-406.
  • 3FUJITO T, TAOKA S, WANTANABE T. On the legal firing sequence problem of Petri nets with cactus structure[J]. IEICE Trans. on Fundamentals of Electronics Communications and Computer Sciences, 2000, E83A(3) 480-486.
  • 4TAOKA S, WATANABE T. Time complexity analysis of the legal firing sequence problem of Petri nets with inhibitor arcs[J]. IEICE Trans. on Fundamen- tals of Electronics Communications and Computer Sciences, E89A(11) : 3216-3226.
  • 5SAKASHITA M, MAKINO K, Fujishige S. Minimum cost source location problems with flow requirements [J]. Theoretical Informatics, Lecture Notes in Computer Sciences, 2006 (3887) : 769-780.
  • 6ALEXANDER E K. Reachability analysis in T-invariant-less Petri nets [J]. IEEE Transactions on Automatic Control, 2003, 48(6) :1019-1024.
  • 7ALEXANDER E. KOSTIN. A reachability algorithm for general Petri nets based on transition invariants [C]. Berlin Heidelberg: Springer-Verlag, 2006.
  • 8MU Der-jeng, MAO Yu-peng. Augmented reachability trees for 1-place-unbounded generalized Petri nets [C]. eds. proc of IEEE Transactions on Systems, man, and cybernetics-part A: systems and humans. 1999, 29(2):173-183.
  • 9Satoshi Taoka, Shinji Furusato, Toshimasa Watanabe. A heuristic algorithm FSDC based on avoidance of deadlock components in finding legal firing sequences of Petri nets [C]. Berlin Heidelberg: Springer-Verlag, 2003.
  • 10AHMED TAREK, NOE LOPEZ-BENITEZ. Optimal legal firing sequence of petri nets using linear programming [J]. Optimization and Engineering, 2004 (5): 25-43.

共引文献5

同被引文献44

引证文献6

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部