• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.400-405
• /
• 1990

This paper deals with the design technique of the controller for the discrete system control using Extended Safe Petri Net which is deduced from Petri Net as its subclass with a specific constraint and which is introduced to develop the design and analysis for the discrete systems. First, we propose a construction matrix suitable for the discrete systems that represent the marking flows which are the dynamic behavior of the discrete systems. Next, we develop a method that can design the controller for the discrete system control by analyzing the proposed construction matrix into the incidence matrix of Extended Safe Petri Net. Finally, the validity of the proposed method is shown by using the incidence matrix and matrix equation of Extended Safe Petri Net model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.2
• /
• pp.111-124
• /
• 1996

The main purpose of this study is to develop an algorithm to solve the scheduling problems of FMS using Petri-net is well suited to model the dynamics of FMS and Petri-net is an ideal tool to formulate scheduling problems with routing flexibility and shared resources. By using the marking of Petri-net, We can model features of discrete even system, such as concurrency, asynchronous, conflict and non-determinism. The proposed algorithm in this paper can handle back-tracking using the marking of Petri-net. The results of the experiment show that marking is one of the best ways that describe exactly movement of the discrete event system. To show the effectiveness of the algorithm suggested here, we compare it with L1 algorithm using the Petri-net through the test on randomly generated test problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.364-364
• /
• 2000

Timed Petri Net(TPN) is one of methods to model and to analyze Discrete Event Dynamic Systems(DEDSs) with real time values. It has two time values, earliest firing time ($\alpha$$_{i}$) and latest firing time ($\beta$$_{I}$) for the each transition. A transition of TPN is fired at arbitrary time of time interval ($\alpha$$_{I}$, $\beta$$_{i}$). Uncertainty of firing time gives difficulty to analyze and estimate a modeled system. In this paper, we proposed the Fuzzy Transition Timed Petri Net(FTTPN) with fuzzy theory to determine the optimal transition time (${\gamma}$$_{i}$). The transition firing time (${\gamma}$$_{i}$) of FTTPN is determined from fuzzy controller which is modeled with information of state transition. Each of the traffic signal controllers are modeled using the proposed method and timed petri net. And its Performance is evaluated by simulation of traffic signal controller. controller.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.916-922
• /
• 2002

본 연구는 WfMS라는 사용환경 하에서, 워크플로우 프로세스라는 대상 객체를 BOM(bill of material) 정보로 부터 High Level Petri net 형식으로 자동적으로 생성할 수 있는 엔진의 개발을 궁극적인 목표로 설정하고 있다. BOM은 제조되는 제품의 구조에 대한 정보를 지니고 있다. 관리 및 생산이라는 두 도메인 사이의 차이점에도 불구하고, 생산 분야의 BOM 정보의 이용방식이 관리 프로세스의 설계에도 이용될 수 잇다는 사실을 먼저 설명한다. 워크플로우 프로세스는 Petri Net의 형식으로 표시한다. 주어진 BOM으로부터 이에 대응하는 petri net을 생성할 수 있는 매핑 알고리즘을 소개한다. 이러한 이론 및 알고리즘을 기반으로 하여, 주어진 BOM 정보로부터 이에 대응하는 Petri Net 정보를 자동으로 생성시키는 프로세스 디자이너의 프로토타입을 구현하여 소개한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.436-443
• /
• 1992

Presented in the paper is a systematic approach to constructing a Petri net model of FAS (flexible assembly system). Petri net is widely used in modeling automated manufacturing systems. But, it found to be very difficult for an FA engineer to build a correct model of an FAS with Petri net symbols (ie, place, transition, and token) from the beginning. An automated manufacturing system in general is built from a set of "standard" hardware components. An FAS in particular is usually composed of assembly robots, work tables, conveyor lines, buffer storages, part feeders, etc. In the proposed modeling scheme, each type of standard resources is represented as a standard "module" which is a sub Petri net. Then, the model of a FAS can be conveniently constructed using the predefined modules the same way the FAS itself is built from the standard components. The network representation of a FAS is termed a JR-net (job resource relation net) which is easy to construct. This JR net is then mechanically converted to a formal Petri net (to simulate the behavior of the FAS). The proposed modeling scheme may easily be extended to the modeling of other types of automated manufacturing systems such as FMS and AS/RS.ch as FMS and AS/RS.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.3
• /
• pp.291-296
• /
• 2006

In context-aware computing environment, some context is characterized by a single event, but many other contexts are determined by a sequence of events which happen with some timing constraints. Therefore context inference could be conducted by monitoring the sequence of event occurrence along with checking their conformance with timing constraints. Some context could be described with fuzzy concepts instead of concrete concepts. Multiple entities may interact with a service system in the context-aware environments, and thus the context inference mechanism should be equipped to handle multiple entities in the same situation. This paper proposes a context inference model which is based on the so-called fuzzy colored timed Petri net. The model represents and handles the sequential occurrence of some events along with involving timing constraints, deals with the multiple entities using the colored Petri net model, and employs the concept of fuzzy tokens to manage the fuzzy concepts.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.12
• /
• pp.84-94
• /
• 1996

In this work, a fuzzy petri net model for modeling a general form of fuzzy production system which consists of chaining fuzzy production rules and so requires multistage reasoning process is presented. For the obtained fuzzy petri net model, the net will be transformed into some matrices, and also be systematically led to an algebraic form of a state equation. Since it is fond that the approximate reasoning process in fuzzy systems corresponds to the dynamic behavior of the fuzzy petri net, it is further shown that the multistage reasoning process can be carried out by executing the state equation.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2008.06a
• /
• pp.11-16
• /
• 2008

본 논문은 온톨로지(ontology) 작성에 사용되는 RDF(Resource Description Framework) 모델을 CPN(Colored Petri Net) 모델로 변환하여 표현하는 방법을 제안하고, 페트리 넷 시뮬레이션으로 RDF의 의미를 해석하여 RDF 질의문에 답할 수 있음을 보인다. 또한, 어떠한 RDF 모델도 CPN 모델로의 변환이 가능하다는 제안 방법의 완전성과 무결성을 소개하고, 제안한 방법으로 구축된 CPN 모델에서 RDF 질의에 대해 정확하게 결과를 구하는 방법을 제시한다.

• Journal of the Korean Society for Railway
• /
• v.13 no.6
• /
• pp.570-576
• /
• 2010

This paper presents the use of the Petri Net Method for modeling railway tracks. The Petri Net is defined as having the characteristics of a parallel, asynchronous, distributed, inconclusive, statistical, etc. information handling system and is a graphical mathematical modeling tool to study the specifics of active movement. It's proven use can be seen at the Korean type Light Rail testing tracks where they modelled the Petri Net method using the train track encasing the segment, track, turnout, and platform as a singular factor and even though two trains either travelling in the same or opposite directions on a single test track equipped with a sidetrack can travel with the guarantee that the two will not collide.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.2
• /
• pp.194-202
• /
• 1998

This paper describes a hardware implementation method of a Petri Net-based controller. A flexible and systematic implementation method, based on look-up tables, is suggested, which enables to build high speed Petri net-based controllers. The suggested method overcomes the inherent speed limit that arises from the microprocessors by using of matrix-based look-up tables. Based on the matrix framework, this paper suggests various specific data path structures as well as a basic data path structure, accompanied by evolution algorithms, for sub-class Petri nets. A new sub-class Petri net, named Biarced Petri Net, resolves memory explosion problem that usually comes with matrix-based look-up tables. The suggested matrix-based method based on the Biarced Petri net has as good efficiency and expendability as the list-based methods. This paper shows the usefulness of the suggested method, evaluating the size of the look-up tables and introducing an architecture of the signal processing unit of a programmable controller. The suggested implementation method is supported by an automatic design support program.