• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.3
• /
• pp.200-207
• /
• 2013

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.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.838-840
• /
• 1999

In this paper, modeling and analysis of discrete event systems by temporal logic frame works and petri net is considered. The reachability tree of the petri net can be used to solve the safeness, boundedness, conservation and coverability problems of discrete event systems. But the reachability tree of the petri net do not solve reachability and liveness problems in general. We proposed a method that synthesised the petri net and the temporal logic frameworks. This method slove some problems of petri net by logical representation of temporal logic frameworks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.12
• /
• pp.3109-3120
• /
• 1996

SDL has been standardized to specify behavioral aspects of communication systems based on the formal description technique, and it is powerful and user friendly in the sense of supporting human communication and understanding, formal analysis andcomparison of behaviors, alternative implementations and design optimization, and its structural decomposition. However, SDL is not sufficient for an efficient handing of entrire system descriptions because the communication systems are generally very complex, and composed from the various interactions among sub-systems. Also, it is very difficult to explicitly verify dynamic views such as liveness and reachability. it leads the demands on analysis scheme to verify dynamic behaviros of specified systems. This paper presents modeling concepts of Petri Nets from SDL and transformation rules to Numerical Petri Nets to provide efficient technqiques for verification of dynamic behaviors, and proposes the reachability garaph that is able to trace all reachable states of a modeled system and reduce an information loss on the reachability tree.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.2
• /
• pp.176-184
• /
• 2000

Possible representation methods for the product structure have been compared and analyzed to determine optimal disassembly path of a product. Petri net is selected as the most optimal method to represent disassembly path of the product. In this method, a reachability tree for the product is generated and disassembly time for each path is calculated. A path with the smallest disassembly time is selected as the optimal path. A software far DPN(Disassembly Petri Net) has been developed and applied to search the optimal disassembly path for a ballpoint pen disassembly process as an example.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.322-330
• /
• 1994

SIBs(Service Independent Building block) are defined in CCITT advanced intelligent network concept model for supporting various services in the future. This paper describes the protocol modeling and verification for basic call process SIB. For modeling, we use Petri Net and verify this modeling by analyzing reachability tree of Petri Net. Results of this paper should be used for design and implementation of basic call process SIB.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.219-225
• /
• 2000

본 연구에서는 이산사건 동적 시스템을 모델링하고 성능을 분석하기 위한 통합 소프트웨어를 개발하였다. 소프트웨어는 페트리네트를 기반으로 비쥬얼 C++와 비쥬얼 베이직을 이용하여 개발되었으며 윈도우즈 환경 하에서 동작하는 범용 그래픽도구를 내장하고 있다. 본 소프트웨어를 이용하면 사용자는 마우스의 드래그 앤 드롭만으로 페트리네트 모델을 작성할 수가 있으며 모델이 작성되면 수리적 분석과 시뮬레이션을 통하여 시스템의 성능분석을 자동으로 수행하여 준다. 또한 시스템의 논리적인 특성을 분석하기 위하여 coverbility tree와 reachability tree를 지원한다. 이외에도 deadlock을 탐지하고 이를 해소하는 기능과 정교한 세부 모델링이 가능하도록 다양한 활성화 함수와 분포를 지원하며 시스템의 성능척도와 관련된 다양한 통계치를 제공해준다.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.641-644
• /
• 2000

This paper studies coverability tree and reach-ability set of Petri net under the earliest filing rule. Conventional algorithm for coverability tree for ‘normal’ Petri net is not good for Petri net under the earliest firing rule. More over, it is shown that there exists no coverability graph for general class of earliest firing Petri net. Some subclasses are studied where coverability graph can be constructed.

• Korean Journal of Cognitive Science
• /
• v.10 no.4
• /
• pp.51-62
• /
• 1999

This paper proposes a fuzzy Petri net representation to represent the fuzzy production rules of a rule-based expert system. Based on the fuzzy Petri net representation. we present a fuzzy reasoning algorithms which consist of forward and b backward reasoning algorithm. The proposed algorithms. which use the proper belief evaluation functions according to fuzzy concepts in antecedent and consequent of a fuzzy production rule. are more closer to human intuition and reasoning than other methods. The forward reasoning algorithm can be represented by a reachability tree as a kind of finite directed tree. The backward reasoning algorithm generates the backward reasoning path from the goal to the initial nodes and then evaluates the belief value of the goal node using belief evaluation functions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.5
• /
• pp.1392-1398
• /
• 2008

This paper presents a Petri Net (PN) based disassembly sequence planning model with precedence operations. All feasible disassembly sequences are generated by a disassembly tree and a disassembly sequence is determined using the disassembly precedence and disassembly value matrix, The precedence of disassembly operations is determined through a disassembly tree and the value of disassembly is induced by economic analysis in the end-of-life phase. To solve the disassembly sequence planning model with precedence operations, a heuristic algorithm based on PNs is developed. The developed algorithm generates and searches a partial reachability graph to arrive at an optimal or near-optimal disassembly sequence based on the firing sequence of transitions of the PN model. A refrigerator is shown as an example to demonstrate the effectiveness of proposed model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.516-525
• /
• 1990

This paper proposes a hierarchical control algorithm for an efficient network management of a loosely-coupled system which consists of functional division and duplicating structure with a LAN to enhance reliability and availability. The algorithm is modeled using the Perti-net and verified with the reachability tree. Here, the proposed algorithm is compared with the purely centralized control algorithm and distributed control algorithm in terms of message traffic for the network management. The result shows that the message traffic related to system performance is as low as centralized control algorithm and the system availability is independent of a specific processor failure.