International Journal of Fuzzy Logic and Intelligent Systems

  • 제13권3호
  • /
  • Pages.200-207
  • /
  • 2013
  • /
  • 1598-2645(pISSN)
  • /
  • 2093-744X(eISSN)
한국지능시스템학회 (Korean Institute of Intelligent Systems)
권호 표지
DOI QR코드

DOI QR Code

A Subclass of Petri Net with Reachability Equivalent to State Equation Satisfiability: Live Single Branch Petri Net

  • Gao, Qian (School of information, Qilu University of Technology) ;
  • Cho, Young Im (College of Information Technology, the University of Suwon)
  • 투고 : 2013.03.10
  • 심사 : 2013.09.14
  • 발행 : 2013.09.25
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Petri Nets are a system description and analysis tool. Reachability is one of the most basic properties in Petri Net research. In a sense, reachability research is the foundation study for other dynamic properties of Petri Nets through which many problems involving Petri Nets can be described. Nowadays, there are two mature analysis methods-the matrix equation and the reachability tree. However, both methods are localized, i.e., it is difficult to find a general algorithm that can determine reachability for an arbitrary Petri Net, especially an unbounded Petri Net. This paper proposes and proves three propositions in order to present a subclass of a Petri Net, the live single-branch Petri Net, whose reachability is equivalent to the satisfiability of the state equation.

키워드

참고문헌

  1. M. Peleg, D. Rubin, and R. B. Altman, "Using petri net tools to study properties and dynamics of biological systems," Journal of the American Medical Informatics Association, vol. 12, no. 2, pp. 181-199, Mar-Apr. 2005. http://dx.doi.org/10.1197/jamia.M1637
  2. J. Padberg, M. Gajewsky, and C. Ermel, "Rule-based refinement of high-level nets preserving safety properties," Science of Computer Programming, vol. 40, no. 1, pp. 97- 118, May 2001. http://dx.doi.org/10.1016/S0167-6423(00) 00022-8
  3. A. S. Ribeiro, E. M. M. Costa, and E. J. Lima II, "Flexible manufacturing systems modelling using high level petri nets," ABCM Symposium Series in Mechatronics, vol. 3, pp. 405-413, 2008.
  4. R. J. Lipton, The Reachability Problem Requires Exponential Space, Yale University, New Haven, CT, Technical Report, no. 62, 1976.
  5. P. Kungas, "Petri net reachability checking is polynomial with optimal abstraction hierarchies," Lecture Notes in Computer Science, vol. 3607, pp. 149-164, 2005. http: //dx.doi.org/10.1007/11527862 11
  6. G. Liu and L. Chen, "Class of Petri nets with equivalence of reachability and state equation satisifability," Computer Engineering and Applications, vol. 43, no. 11, pp. 84-86, 2007.
  7. T. Murata, "Petri nets: properties, analysis and applications," Proceedings of the IEEE, vol. 77, no. 4, pp. 541- 580, Apr. 1989. http://dx.doi.org/10.1109/5.24143
  8. A. Xu and Z. Wu, "Live weighted t-system: reachability problem and the satisfiability of the state equation problem," Computer Science, vol. 26, no. 6, pp. 41-43, 1999.
  9. Y. Bao, F. Lu, and Q. Zeng, "Two classes of petri net with reachability equivalent to state equation satisfiability," Journal of System Simulation, vol. 19, no. 1, pp. 44-46, 2007.
  10. K. M. Lee, K. M. Lee, and K. S. Hwang, "Fuzzy colored timed petri nets for context inference," Journal of Korean Institute of Intelligent Systems, vol. 16, no. 3, pp. 291-296, Jun. 2006. http://dx.doi.org/10.5391/JKIIS.2006.16.3.291
  11. Y. S. Mo, J. C. Kim, J. K. Kim, and H. S. Hwang, "Fuzzy transition timed petri net for modeling and analyzing of discrete event dynamic systems," Journal of Korean Institute of Intelligent Systems, vol. 11, no. 2, pp. 119-126, Apr. 2001.
  12. J. K. Kim, J. C. Kim, and H. S. Hwang, "Modeling of the fuzzy discrete event system and it's application," Journal of Korean Institute of Intelligent Systems, vol. 14, no. 4, pp. 487-492, Jul. 2004. http://dx.doi.org/10.5391/JKIIS. 2004.14.4.487
  13. H. Dong and J. Yang, "Petri net: concept, analysis method and application," Natural Science Journal of Harbin Normal University, vol. 15, no. 5, pp. 59-63, 1999.
  14. Z. Wu, Petri Network Introduction, Chinese ed., Beijing: Machine Press, 1991.
  15. Q. Gao, D. Zhou, and A. Li, "An algorithm for construction of petri-nets' improved coverability tree," in Progress of Computer Technology and Application, 2009, pp. 334- 338.