지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국지능시스템학회 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS Vol.13 No.3
- 발행연도
- 2013.9
- 수록면
- 200 - 207 (8page)
이용수
초록· 키워드
오류제보하기
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.
목차
Abstract
1. Introduction
2. Related Work
3. Basic Notations and Definitions of Petri Net
4. The Subclass of Petri Net with Reachability Equivalent to State Equation Satisfiability
5. Conclusion
References
참고문헌 (1)
참고문헌 신청
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0