• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.205-205
• /
• 2000

In this paper, we are proposed an analysis method of the operation schedule in FMS using Time Petri Nets(TPN) unfolding. TPN's unfolding is one of the analysis methods after changed non-cyclic net from the concurrent net without to expand the state explosion. We are illustrated this proposed to analyze a schedule problem in Ratio-driven FMS modeling.

• Journal of Computing Science and Engineering
• /
• 제9권1호
• /
• pp.9-19
• /
• 2015

The most important challenge in the region-based abstraction method as an approach to compute the state space of time Petri Nets (TPNs) for model checking is that the method results in a huge number of regions, causing a state explosion problem. Thus, region-based abstraction methods are not appropriate for use in developing practical tools. To address this limitation, this paper applies a modification to the basic region abstraction method to be used specially for computing the state space of TPN models, so that the number of regions becomes smaller than that of the situations in which the current methods are applied. The proposed approach is based on the special features of TPN that helps us to construct suitable and small region graphs that preserve the time properties of TPN. To achieve this, we use TPN-TCTL as a timed extension of CTL for specifying a subset of properties in TPN models. Then, for model checking TPN-TCTL properties on TPN models, CTL model checking is used on TPN models by translating TPN-TCTL to the equivalent CTL. Finally, we compare our proposed method with the current region-based abstraction methods proposed for TPN models in terms of the size of the resulting region graph.

• 한국컴퓨터정보학회논문지
• /
• 제4권3호
• /
• pp.13-19
• /
• 1999

본 연구는 TPN (Time Petri Nets) unfolding을 이용하여 가공 machine과 세정 machine으로 구성된 FMC (Flexible Manufacturing Cell)의 WIP (Work In Process)를 분석하는 방법을 제시한다. 여기서, PN의 unfolding은 상태공간폭발이 발생하지 않는 concurrent system의 검증에 사용되는 순서기반 방법이다. 본 연구는 일반적으로 발생하는 순환상태 스케쥴 문제에서 가장 그 작업과정 시간을 최적화하기 위하여 원래의 net을 동일한 비순환 net으로 바꾸어 줄 수 있는 unfolding 개념을 기반으로 한 것이다.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.128-147
• /
• 1991

We propose a dynamic incidence matrix (DIM) for reflecting states and time conditions of a timed Petri net (TPN) explicitly. Since a DIM consists of a conventional incidence matrix, two time-related vectors and two state-related vectors, we can get the advantages inherent in the conventional incidence matrix of describing a static structure of a system as well as another advantage of expressing time dependent state transitions. We introduce an algorithm providing the DIM with a state transition mechanism. Because the algorithm is, in fact, an algorithmic model for discrete event simulation of TPN models, we provide a theoretical basis of model transformation of a TPN model into a DEVS(Discrete Event system Specification) model. By executing the algorithm we can carry out performance analysis of computer communication protocols which are represented TPN models.

• 제어로봇시스템학회논문지
• /
• 제7권4호
• /
• pp.344-350
• /
• 2001

In this paper, we are focused on the analysis of acyclic schedule for the determination of the opti-mal cycle time and minimization of work in process. Especially, this paper deals with the product ratio-driven cyclic scheduling problem in FMS with different products and ratio using the TPN(Time Petri Nets)un-folding.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권10호
• /
• pp.1303-1310
• /
• 1999

In this paper, the Timed Petri-Nets(TPN) modeling of Modular Cell Manufacturing Systems(MCMS) was investigated to overcome the limit of batch mode operation, which has been one of the most popular manufacturing types to produce an extensive industrial output and to be able to adopt to suitable and quickly changing manufacturing environments. A model of the MCMS was developed in reference to the actual TFT-LCD manufacturing system. TFT-LCD manufacturing system is not mass-productive in batch mode, but it operates in the form of MCMS which consists of a sequence of several cells with four processes of operation, including those of color filter(C/F), TFT, cell, and module. The cell process is further regrouped in those of Front-End and Back-End. For the Back-End cell process, it is reconstructed into a virtual model, consisting of three cells. The TPN modeling encompasses those properties, such as states and operations of machines, the number of buffers, and the processing time. The performance of the modeling was further examined in terms of scheduling system. The productivity in each cells was examined with respect to the change of failure rate of the cell machines and Automatic Guided Vehicles(AGV) using simulation by TPN.

• 전자공학회논문지C
• /
• 제34C권5호
• /
• pp.9-18
• /
• 1997

The petri net is a graphic model which is adaptable in modeling a complex concurrent parallel ssystem, and it is widely used in the fields of industrial enginering, computer science, electric engineeringand chemistry. Recently, the net is applied to the communication protocol, and extended to represent complex systems. There are several extended petri nets named as TPN (timed petri net), SPN (stochastic petri net), FPN(fuzzy petri net) and TFPN(timed fuzzy petri net). Accodingly, this SPN (stochastic petri net), FPN (fuzzy petri net) and TFPN(timed fuzzy petri net). Accodingly, this paper proposes an advanced communication protocol modeling method using the fuzzy value of the transition and firing delay time as the arguments of the function. The proposed method can produce clearer firing rules, and it is supposed to be used to design and analyse communication protocols in great effection.

• 한국통신학회논문지
• /
• 제36권4B호
• /
• pp.354-361
• /
• 2011

스마트 홈 분야에 대한 관심의 증가와 기술적인 발전은 상황인지 서비스와 베이시안 네트워크 알고리즘, 트리 구조 알고리즘 그리고 유전자 추측 알고리즘과 같은 예측 알고리즘에 대한 연구가 활발히 이루어지고 있다. 상황 인지 서비스는 개별적인 사용자의 패턴을 고려한 맞춤형 서비스를 제공하는 것은 사용자의 삶의 질을 향상시키는 데 도움 주는 것을 의미한다. 하지만 상황인지 서비스를 구현 하는 것은 상황정보와의 부합성 문제와 예외적인 상황 처리가 고려하는데 어려움을 겪고 있다. 이 문제를 해결하기 위해서, 본 연구에서는 지능형 순차적 매칭 방식 알고리즘(Intelligent Sequential Matching Algorithm : ISMA)을 제안하고, 페트리 넷에 시간 개념을 추가하여 시간 페트리 넷(Timed Petri-net : TPN)으로 모델링한다. 제안한 지능형 순차적 매칭 알고리즘의 유효성을 증명하기 위하여 시나리오를 제시하고, 그것을 모델링 한다. 또한 동일한 실험 조건 아래, 기존의 예측 알고리즘과 비교를 통하여 과 제안된 알고리즘의 예측 정확도가 4~6% 우수함을 보인다.