• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.330-335
• /
• 1993

This paper presents an efficient solution for a class of forbidden state problems by introducing a cyclic timed controlled marked graphs (TCMG's), a special class of timed controlled Petri nets (TCPN's) as a model of a class of discrete event systems (DES's). The state feedback control is synthesized, which is maximally permissive while guaranteeing the forbidden states will be avoided. The practical applications or tire theoretical results for an automated guided vehicle (ACV) coordination problem in a flexible manufacturing facility is illustrated.

• 한국통신학회논문지
• /
• 제14권3호
• /
• pp.207-215
• /
• 1989

본 논문은 타임 페트리 네트에서 천이에 제약과 확률 밀도 함수를 추가한 확장된 타임 페트리 네트를 제안하고, 이를 이용한 분산된 시스템의 분석 방법을 제시하였다. 도달 가능에 기반을 둔 분석 방법은 성능에 관한 네트들의 동작을 고려하여 효율성을 표시하고, 제안한 확장된 타임 페트리 네트 모델이 시스템의 명세화에 보다 정확도를 제공하므로써 작업에 얼마나 적합한가를 모의 실험 하는 것이다. 마지막으로, 분석된 시스템을 구별하고, 평가하기 위한 분석 기구 장치로써 타임 페트리 네트를 기반으로 하여 연구하는 것이다.

• 제어로봇시스템학회논문지
• /
• 제5권6호
• /
• pp.724-733
• /
• 1999

An effective method of system modeling and dynamic scheduling for the back-end line of semiconductor manufacturing is proposed. The virtual factory, describing semiconductor manufacturing line, is designed in detail, and then a Petri net model simulator is developed for operation and control of the modular cells of the virtual factory. The petri net model is a colored timed Petri nets (CTPNs). The simulator will be utilized to analyze and evaluate various dynamic status and operatons of manufacturing environments. The dynamic schedulaer has a hierarchical structure with the higher for planning level and the lower for dynamic scheduling level. The genetic algorithm is applied to extract optimal conditions of the scheduling algorithm. The proposed dynamic scheduling is able to realize the semiconductor manufacturing environments for the diversity of products, the variety of orders by many customers, the flexibility of order change by changing market conditions, the complexity of manufacturing processes, and the uncertainty of manufacturing resources. The proposed method of dynamic scheduling is more effective and useful in dealing with such recent pressing requirements including on-time delivery, quick response, and flexibility.

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

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

• 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.

• Transactions on Control, Automation and Systems Engineering
• /
• 제2권2호
• /
• pp.121-129
• /
• 2000

In this paper, an optimal group control for elevator systems is proposed with timed Petri net based approach. Elevator system is modeled by time Petri nets and hall call response times are estimated with moment generating functions (MGFs) methos, which is applicable to real traffic patterns. Two assignment policies are proposed to satisfy the demands of passengers(i.e. hall/car calls) and to handle exceptional situations. In addition, optimal algorithms are implementated to minimize cost functions. THe performances of the elevator system employing the proposed algorithms are compared with each others in ways of several performance measures by a computer simulation.

• 한국시뮬레이션학회논문지
• /
• 제25권4호
• /
• pp.21-30
• /
• 2016

최근 자동 생산 시스템은 PLC (Programmable Logic Controller) 제어 프로그램을 일반적으로 사용하고 있다. 생산제품의 수명 주기가 길지 않기 때문에 공법과 라인 및 설비 변경이 자주 일어난다. 대부분, 기존 공정을 바탕으로 이루어지고 설비의 위치 및 제어정보를 수정한다. PLC 제어 프로그램 또한 기존 공정을 바탕으로 수정이 이루어진다. 새로운 제어 프로그램을 검증하기 위해서는 실제 생산 시스템을 구축하기 전에 가상의 공간에서 실제 공정과 같이 구성하여 순차적으로 공정이 진행되는 지 확인할 수 있는 방법이 필요하다. 본 연구는 순차제어(sequential control)와 병목현상 처리에 유용한 Timed-FSA를 기반으로 하는 논리적인 모델링 방법을 사용한다. 기존에 연구되었던 I-O 모델링과 I-O 모델링에서 요구되었던 하나의 설비에 다양한 상태의 정의를 통해 사용자의 시간과 공수를 절감하기 위한 기존 모델링에 페트리네트의 토큰(Petri Nets Coloured Token) 개념을 추가한 확장된 I-O 모델링 방법을 제안한다. 예제 설비를 통하여 사용자의 모델링 시간을 절감하는 실험과 사용자 평가를 통해 제안하는 확장된 I-O 모델링의 편의성을 검증한다.

• 대한전기학회논문지:전력기술부문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.

• International Journal of Control, Automation, and Systems
• /
• 제1권4호
• /
• pp.431-443
• /
• 2003

This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.

• 한국경영과학회지
• /
• 제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.