• Article
  • | |
  • Metrics
  • |
  • Reference [11]
  • |
  • Related [20]
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    The problem of constructing a Petri net feedback controller, which enforces the conjunction of a set of linear inequalities on the reachable marking of the plant modeled by Petri net, is discussed in this paper. A new net reduction──HMSNR (holding marking sum net reduction), is presented, which fuses all the constrained places into one place whose marking is equal to the sum of the markings of the constrained places. The net reduction eases design of controller and holds remarkable advantage especially for the systems with large scale. The method is proved to be simpler and more efficient than the method presented by Moody, et al., using an applied instance that is also used by Moody, et al.

    Reference
    [1]Holloway LE, Krogh BH. Synthesis of feedback logic for a class of controlled Petri nets. IEEE T-AC, 1990,35(5):514~523.
    [2]Li Y, Wonham WM. Control of vector discrete-event systems I--The base model. IEEE T-AC, 1993,38(8):1214~1227.
    [3]Li Y, Wonham WM. Control of vector discrete-event systems II--The base model. IEEE T-AC, 1994,39(3):512~531.
    [4]Yamalidou K, Moody JO, Lemmon MD, Antsaklis PJ. Feedback control of Petri nets based on place invariants. Automatica, 1996, 32(1):15~18.
    [5]Juan EYT, Tsai JJP, Murata T, Zhou Y. Reduction methods for real-time systems using delay time Petri nets. IEEE Transactions on Software Engineering, 2001,27(5):422~448.
    [6]Zhou M. Reduction of timed marked graphs and its applications to manufacturing systems. In: Proceedings of the 1994 IEEE International Conference on Robotics and Automation. 1994. 801~806. http://intl.ieeexplore.ieee.org/Xplore/DynWel.jsp.
    [7]LEE JK. Reduction rules of Petri nets for verification of the communication protocol. In: Proceedings of the IEEE Singapore International Conference on Information Engineering. 1995. 294~298. http://intl.ieeexplore.ieee.org/Xplore/DynWel.jsp.
    [8]Mugarza JC, Camus H, Gentina JC, Teruel E, Silva M. Reducing the computational complexity of scheduling problems in Petri nets by means of transformation rules. In: Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. 1998. 19~25. http://intl.ieeexplore.ieee.org/Xplore/DynWel.jsp.
    [9]Yuan CY. Petri Net Theory. Beijing: Publishing House of Electronics Industry, 1998 (in Chinese).
    [10]Krogh BH, Holloway LE. Synthesis of feedback logic for discrete manufacturing systems. Automatica, 1991,27(4):641~651.
    [11]袁崇义.Petri网原理.北京:电子工业出版社,1998.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

王寿光,颜钢锋,蒋静坪.网简化技术在Petri网反馈控制器设计中的应用.软件学报,2003,14(6):1037-1042

Copy
Share
Article Metrics
  • Abstract:3725
  • PDF: 4885
  • HTML: 0
  • Cited by: 0
History
  • Received:September 03,2002
  • Revised:October 22,2002
You are the first2033380Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063