• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.159-178
• /
• 1995

Supervisory control is an approach based on formal language. it is used to model and control discrete event systems in which each discrete event process is represented as an automation. A supervisor is a generator that switches control patterns in such a way that a given discrete evenet process behaves in obedience to various constraints. A flexible manufacturing cell (FMC) is one of discrete evenet systems. Functions necessary for the operation of an FMC are characterized by operational components and informational compoments. The operational components can be modeled using the finite state machines and the informational components can be modeled using the abstract formalism which describes supporting operations of the cell controller. In this paper, we addressed function required for FMC control specification, software engineering aspects on FMC control based on supervisory control, a concept of event queue for resolving synchronization problem, and complexity reduction. Based on the mathematical model of an FMC. we synthesized the controller by integrating a supervisor for FMC with control specification that specifies event-driven operation of the cell controller. The proposed control scheme is stable mathematically so that the system always behaves on a controlled way even under the existence of uncontrollable events. Furthermore, using an event queue concept, we can solve a synchronization problem caused by the violation of instantaneity assumption of supervisory control theory in real life situation. And also, we can propotype a control software rapidly due to the modularity of the proposed control scheme.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.1
• /
• pp.30-37
• /
• 2016

A multi-server queueing system with an infinite buffer and impatient customers is analyzed. The system operates in the finite state Markovian random environment. The number of available servers, the parameters of the batch Markovian arrival process, the rate of customers' service, and the impatience intensity depend on the current state of the random environment and immediately change their values at the moments of jumps of the random environment. Dynamics of the system is described by the multi-dimensional asymptotically quasi-Toeplitz Markov chain. The ergodicity condition is derived. The main performance measures of the system are calculated. Numerical results are presented.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1174-1177
• /
• 1987

The design of flow control protocols for integrared networks with complete voice traffic on the data link level is investigated. The class of admissible flow control policies analyzed maximized the average data link throughput subject to an average system time delay constraints a finite intervals (O,s). In particular, it is shown that the optimum control law is bang-bang (window flow mechanism). The window size L can be analytically derived from maximum tolerated time delay T, the input arrival C of the queueing system, the duration of the time interval S, the initial number of packets in the queue.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.3
• /
• pp.220-228
• /
• 1996

This paper presents a extended stochastic Petri net (ESPN) model for CTN(Circulated Token with No duration) service in the data link layer of IEC/ISA fieldbus. It is assumed that a station on the fieldbus has a specified minimum token holding time, a finite capacity buffer, and one transmitter queue with the highest priority. The mean transmission (or service) time at a station and the mean token rotation time for the symmetric fieldbus system atr derived using the presented SPN model and the moment generating function. These performance measures are represented in terms of the minimum token holding time, the number of stations, the arrival rate of messages, and the mean length of messages. The presented performance measure are validated by computer simulations.

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.351-373
• /
• 2020

There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.583-592
• /
• 1998

In this paper, the cell loss rate is analyzed in terms of the input traffic stream of different speed in ATM network. The cell loss rate is calculated by birth-death process of Leaky-Bucket mechanism as the representative algorithm of usage parameter control. The cell loss rate assumed 2-state MMPP input process to be birth-death process by considering the character of token pool about finite capacity queue. The results from numerical analysis show that the cell loss rate decreases abruptly according to the buffer size increase. The computer simulation by SIMSCRIPT II.5 has been done and compared with on/off input source case to verify the analysis results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2484-2496
• /
• 2000

High speed switches have been developing to interconnect a large number of nodes. It is important to analyze the switch performance under various conditions to satisfy the requirements. Queueing analysis, in general, has the intrinsic problem of large state space dimension and complex computation. In fact, The petri net is a graphical and mathematical model. It is suitable for various applications, in particular, manufacturing systems. It can deal with parallelism, concurrence, deadlock avoidance, and asynchronism. Currently it has been applied to the performance of computer networks and protocol verifications. This paper presents a framework for modeling and analyzing ATM switch using stochastic activity networks (SANs). In this paper, we provide the ATM switch model using SANs to extend easily and an approximate analysis method to apply A TM switch models, which significantly reduce the complexity of the model solution. Cell arrival process in output-buffered Queueing A TM switch with finite buffer is modeled as Markov Modulated Poisson Process (MMPP), which is able to accurately represent real traffic and capture the characteristics of bursty traffic. We analyze the performance of the switch in terms of cell-loss ratio (CLR), mean Queue length and mean delay time. We show that the SAN model is very useful in A TM switch model in that the gates have the capability of implementing of scheduling algorithm.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1992.10a
• /
• pp.3-3
• /
• 1992

타이어 Curing공정은 공기압 타이어의 제조시 상당히 정교한 단계를 거쳐서 이루어지며, 이는 타이어 설계에 큰 영향을 줄 뿐만아니라, 타이어의 성능에도 관건이 있다. 본 연구에서는 유한요소법을 이용하여 타이어의 molding 공정을 분석하였다. 유한요소해석 프로그램인 MARC가 Cured 타이어 내부의 Curing Bladder 팽창과정해석에 이용되었다. 비압축성 요소로 Curing Bladder를 모형화하였으며, MARC의 접촉문제해석기법(contact option)을 이용하여 Cured 타이어 내부와 Curing Bladder 외부의 접촉부위를 Simulation하였다. 본 연구의 주요 관심내용으로서는 Curing Bladder의 형상변화에 따른 Curing Bladder의 팽창거동해석과, Cured타이어와 Curing Bladder의 접촉부위에서 얻을 수 있는 접촉압력의 비교.검토이다. 타이어 Curing시 타이어와 Bladder의 Contact과정을 해석하여, 아래와 같은 결과를 도출하였다. Bladder의 형상은 Cylinderical 형상 보다는 Toroidal 형태가 접촉압 분포의 균일성 및 크기 측면에 서 우수한 것으로 판단된다. Curing Bladder의 증심선 부위 보다 이에서 약간 떨어진 부위에서 최대 접촉압력이 발생되며, 이는 타이어 내면의 굴곡현상과 깊은 관련이 있윰 것으로 사료된다. 타이어 Bead부의 Carcass 자연평형현상이 유지된 제품을 얻기위해서는, Side-Bead구간의 접촉압력 증가가 필요하며, 이를 위하여는 Bladder 형상이 Cylinderical 보다는 Toroidal 형태가 유리하고, Bead부의 Gage Down, 전체직경의 증가 및 높이의 증가가 유리한 것으로 판단된다. 본 연구 결과를 이용하여, 타이어 Curing과정에서 발생되는 불량제품의 원인파악 및 타이어 설계자가 원하는 제품생산의 불가능한 원인을 파악하는데 도움을 줄 것이다.를 C의 structure와 pointer를 기반으로 하게끔 변경시키고 이에 따르는 제반 변경 사항을 수정 보완하여 프로그램의 분석을 용이하게 하며 기능의 변경 및 추가가 수월하게 하였고 메모리를 동적으로 관리할 수 있게 하였다. 또한 기존의 smpl에 디버깅용 함수 및 설비(facility) 제어용 함수를 추가하여 시뮬레이션 프로그램 작성을 용이하게 하였다. 예를 들면 who_server(), who_queue(), pop_Q(), push_Q(), pop_server(), push_server(), we(), wf(), printfct() 같은 함수들이다. 또한 동시에 발생되는 사건들의 순서를 조종하기 위해, 동시에 발생할 수 있는 각각의 사건에 우선순위를 두어 이 우선 순위에 의하여 사건 리스트(event list)에서 자동적으로 사건들의 순서가 결정되도록 확장하였으며, 설비 제어방식에 있어서도 FIFO, LIFO, 우선 순위 방식등을 선택할 수 있도록 확장하였다. SIMPLE는 자료구조 및 프로그램이 공개되어 있으므로 프로그래머가 원하는 기능을 쉽게 추가할 수 있는 장점도 있다. 아울러 SMPLE에서 새로이 추가된 자료구조와 함수 및 설비제어 방식등을 활용하여 실제 중형급 시스템에 대한 시뮬레이션 구현과 시스템 분석의 예를 보인다._3$", chain segment, with the activation energy of carriers from the shallow trap with 0.4[eV], in he amorphous regions.의 증발산율은 우기의 기상자료를 이용하여 구한 결과 0.05 - 0.10 mm/hr 의 범위로서 이로 인한 강우손실량은 큰 의미가 없음을 알았다.재발이 나타난 3례의 환자를 제외한 9례 (75%)에서는 현재까지 재발소견을 보이지 않고 있다. 이러한 결과는 다른 보고자들과 유사한 결과를 보이고 있지만 아직까지 증례가 많지 않기 때문에 생존율을 얻