期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

广义无界Petri网的新型有限可达树研究 被引量：1

A New Finite Reachability Tree For Generalized Unbounded Petri Nets
下载PDF
导出
摘要 无界Petri网目前使用有限可达树来进行可达性分析,但尚未彻底解决,主要问题在于树中虚假状态信息的存在。针对此问题,提出了一种新型可达树——精准有限可达树(Exact Finite Reachability Tree,EFRT),保证了树中没有增加虚假的可达状态信息,并且在树的继续生长中没有丢失任何状态信息,将为可达性问题的研究提供一种新思路与新方向。 This paper proposes a new kind of reachability tree———Exact Finite Reachability Tree.lt ensures that the tree does not increase fake reachable information,and does not lose any information when the tree continues to grow.lt is to be provided by a new idea and a new direction for the study of reachability issue.
作者 余晓龙
机构地区 东南大学自动化学院
出处 《工业控制计算机》 2015年第9期79-81,共3页 Industrial Control Computer
关键词 无界Petri网 新型可达树 可达性问题 Unbounded Petri Net new reachability tree reachability problem
分类号 TP301.1 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献19

  • 1Ding Z J,Jiang C J, Zhou M C. Deadlock checking for one- place unbounded Petri nets based on modified reachability trees[J]. Systems, Man, and Cybernetics, Part B: Cybernet- ics, IEEE Transactions on, 2008, 38(3): 881-883.
  • 2Der Jeng M, Peng M Y. On the liveness problem of 1- place-unbounded Petri nets[C]//Systems, Man, and Cyber- netics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on. IEEE, 1997, 4: 3221- 3226.
  • 3Der Jeng M, Peng M Y. Augmented reachability trees for 1- place-unbounded generalized Petri nets [J]. Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Trans- actions on, 1999, 29(2): 173-183.
  • 4Karp R M, Miller R E. Parallel program schemata[J]. Journal of Computer and system Sciences, 1969, 3(2): 147-195.
  • 5Murata T. Petri nets: Properties, analysis and applications[J]. Proceedings of the IEEE, 1989, 77(4): 541-580.
  • 6Peterson J L. Petri net theory and the modeling of systems [J]. 1981.
  • 7Ru Y,Wu W, Hadjicostis C N.Comments on A Modified Reach- ability Tree Approach to Analysis of Unbounded Petri Nets [J].IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBER- NETICS PART B, 2006, 36(5):1210.
  • 8Wang F Y.A modified reachability tree for Petri nets [C]// Systems, Man, and Cybernetics, 1991.'Decision Aiding for Complex Systems, Conference Proceedings., 1991 IEEE In- ternational Conference on. IEEE, 1991:329-334.
  • 9Wang F Y, Gao Y, Zhou M C. A modified reachability tree approach to analysis of unbounded Petri nets [J]. Systems, Man, and Cybernetics,Part B:Cybernetics, IEEE Transactions on, 2004, 34(1): 303-308.
  • 10Mayr E W. An algorithm for the general Petri net reachabil- ity problem[J]. SIAM Journal on computing, 1984, 13(3): 441-460.

二级参考文献10

  • 1[1]S B Akers. Binary decision diagrams [J]. IEEE Transaction On Computers, June 1978, C-27, (6): 509-516.
  • 2[2]R Bryant. Symbolic Boolean Manipulation with Ordered Binary decision diagrams [J]. ACM. Computing Surveys, Sept. 1992, 24(3): 293-318.
  • 3[3]B Buchberger. Introduction to Gr(o)bner Bases [M]. In: Gr(o)bner Bases and Applications (B. Buchberger, F. Winkler, eds.), London Mathematical Society Lecture Notes Series 251, Cambridge University Press, 1998, 3-31.
  • 4[4]O Caprotti, A Ferscha, H Hong. Reachability Test in Petri Nets by Gr(o)bner Bases [M]. Research Institute for Symbolic Computation, Johannes Kepler Universit(a)t, A-4020 Linz, AUSTRIA, 1995.
  • 5[5]J Hopfield, D Tank. Neural computation of decisions in optimization problems [J]. Biological Cybernetics, 1985, 52: 141-152.
  • 6[6]W K Lai, G G Coghill. Genetic breeding of control parameters for the Hopfield/Tank neural net [C]. In: Proc. Int. Joint Conf. Neural Networks, 1992, 4: 618-623.
  • 7[7]E Pastor, J Cortadella, O Roig. Symbolic Analysis of Bounded Petri Nets [J]. IEEE Transaction On Computers, 2001, 50(5): 432-448.
  • 8[8]C A Petri. Kommunikation mit Automaten [Z]. Bonn: Institut für Instrumentelle Mathematik, Schriften des IIM Nr.2, 1962.
  • 9[9]D Psaltis, N Farhat. Optical information processing based on associative-memory model of neural nets with thersholding and feedback [J]. Opt. Lett. 10, 1985, 98-100.
  • 10[10]W J Yeh, M Young. Compositional Reachability Analysis Using Process Algebra, NEC ResearchIndex, 1991 [EB/OL]. http://citeseer.nj.nec.com/.

共引文献1

同被引文献3

引证文献1

工业控制计算机
2015年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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