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

• 한국멀티미디어학회논문지
• /
• 제2권2호
• /
• pp.200-216
• /
• 1999

본 연구에는 멀티미디어 타이틀의 저작과 동기화 문제를 효과적으로 명세하고 분석할 수 있으며, 타이틀의 재생을 직접 제어할 수 있는 통합모형인 BTPN모형과 패러다임들을 제시한다 타이틀내의 객체들간의 모든 관계들을 BTPN구조와 BTPN언어로 명세하는 방법과 잔여시간형 도달성그래프, 타이밍다이어그램 둥을 이용하여 BTPN을 분석하는 방법을 제시하였다. 특히, PERT/CPM방법으로부터 도입한 임계객체경로나 최 장경로 개념은 타이틀 저작 및 재생시의 불확실성을 모형화하며 재생시간의 조정도 가능하게 하고 있다.

• 제어로봇시스템학회논문지
• /
• 제3권1호
• /
• pp.101-108
• /
• 1997

The initial token value required to the optimal performance of discrete event systems can be decided by Sum of Delay Time and Synchronic Time ratio, which are new synchronic variables in Timed Place Petri Nets. For the system consisting of two Live-and-Bounded circuits(LB-circuits) fused in common Transition-Transition-Path or common Place-Place-Path, we prove that the Synchronic Time Ratio is the initial token ratio between two LB-circuits to optimally perform system functions. These results are generalized and formulated as a theorem. The initial tokens of a specific place can imply shared resources. Using the theorem, we can decide the minimum number of the shared resources to obtain the optimal performance, and minimize the idling time of resources. As an example, an automated assembly system is modeled by Timed Place Petri Net, and the initial tokens to achieve the optimal system performance are identified. All the values are verified by simulation.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1990년도 춘계공동학술대회논문집; 한국과학기술원; 28 Apr. 1990
• /
• pp.22-31
• /
• 1990

본 논문에서는 컴퓨터 통신 프로토콜의 모델링과 시뮬레이션에 관한 이론적 인 연구를 하였다. 먼저 통신 프로토콜의 정의와 기능을 설명하였고 통신 프 로토콜을 위한 모델을 분류하였다. 또한, 통신 프로토콜의 모델 중에 Timed Petri Net(TPN) 모델에 시간함수 .tau.를 부여함으로써 TPN을 구조적으로 정의하였으며 TPN Based 모델의 문제점을 보완하기 위하여 시스템 시뮬레 이션 분야의 이산사건 시스템 명세(DEVS:Discrete Event Simulation) 개념 을 도입하였다. 중요한 연구 결과로서 TPN모델이 DEVS모델이라는 정리를 제시하고 증명하였다. 이 정리에 따르면, TPN모델을 시뮬레이션 할 때 시뮬 레이션을 위해 모델을 설계할 필요없이 DEVS모델로 변환하여 사용함으로써 시뮬레이션을 수행할수 있다.

• 한국시뮬레이션학회논문지
• /
• 제9권1호
• /
• pp.67-81
• /
• 2000

In this paper, a new software package for modeling and simulating discrete-event dynamic systems is developed. The new software is a general-purpose, graphical tool based on timed Petri-nets and is developed using Visual Basic and Visual C++ for the window environment. It allows the user to graphically build a Petri-net model and enter input data for executing the Petri-net simulation model. It is equipped with a deadlock detection and recovery function as well as an automatic error check function. In addition, the software supports various enabling functions and distribution functions and provides various statistics for the performance measures of interests pertaining to the system. We expect the new software will be used in a wide number of applications including computer, communication and manufacturing systems.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2003년도 춘계학술대회
• /
• pp.299-304
• /
• 2003

Manufacturing companies must possess a new type of production system with characteristics of reconfigurability, reusability and scalability (Dove 1995), i.e. an agile manufacturing system. Such system will allow flexibility not only in producing a variety of part, but also in changing the system itself, which is a difference form flexible manufacturing systems. A fundamental early step in the reconfiguring process for agile manufacturing system is to develop a model that adequately describes the proposed systems, in order to be able to study and evaluate the impact of the reconfiguring decision on the system performance, before its construction. Therefore, in this paper, an Object & Knowledge-based Interval Timed Petri-Net (OKITPN) approach is proposed.

• 한국통신학회논문지
• /
• 제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.

• 한국통신학회논문지
• /
• 제18권5호
• /
• pp.695-707
• /
• 1993

Marked Petri Net(MPN) 모델은 최대 병행 활성화 랑데부 수에 따른 통신 복잡도를 분석할 수 있게 해준다. 그러나 이 모델은 시간과 확률 속성(Time and Probability characteristics)을 명시할 수 없음으로 통신 복잡도의 새로운 개념인 실행 시간 복잡도를 분석할 수 없다. 본 논문에서는 이러한 실행 시간 복잡도를 효율적으로 분석하기 위해 MPN에 새로운 제약 조건인 net 절감 법칙, 실행 시간, 그리고 확률 조건을 도입한 Ada Tasking Structure Nets(ATSN)을 제안한다. 끝으로 ATSN 모델을 이용하여 통신 복잡도의 분석 효과를 보인다.

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