• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.343-346
• /
• 2011

대부분의 퍼즐 게임에서 발생 할 수 있는 중요한 문제 중 하나는 교착상태 문제이다. 본 논문에서는 이러한 교착상태를 해결하기 위해 퍼즐 게임을 그래프 기법으로 나타낸 뒤, 이를 이용한 새로운 교착상태 발견 기법인 Cycle Detection을 제안한다. 기존의 기법들은 알고리즘을 수행하는데 너무 많은 시간이 걸리거나, 패턴에 대한 데이터베이스가 구축되어 있어야 하기 때문에 실시간으로 교착상태를 발견하기엔 문제가 있다. 본 논문에서는 이러한 문제점을 해결하기 위하여 탐색해야 하는 노드의 개수를 최대한 줄이는 Local search 기법과 Pruning 기법을 적용하여 퍼즐 게임을 플레이하는 동안 실시간으로 교착상태를 발견할 수 있는 기법을 제안한다. 본 기법은 성능을 평가하기 위해 실제 퍼즐게임 환경에서 알고리즘을 수행하고, 그 결과로 검색하는 노드의 개수와 검색 시간을 기존의 기법과 비교하여 성능향상을 확인하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.6
• /
• pp.268-277
• /
• 2001

최소의 다중전송 지연시간을 갖기 위하여 다중 목적지 패킷의 경로 길이와 웜의 초기화 횟수를 최소화한 다중전송 알고리즘을 제안한다. 그 알고리즘은 교착이 탈출 채널에서 복구되면서 단일 전송과 다중전송 메시지에 대하여 완전 적응하며 교착이 발생하지 않게 한다. Disha로 동시에 경로 기반 다중 전송 할 때 교착이 발생하지 않기 위해서는 2개의 교착버퍼가 필요하다. 다중 전송 지연 시간은 메시지 startup 지연시간에 좌우된다. 제안된 시스템은 단지 2번 이하의 메시지 startup 횟수를 가지며 이것은 기존의 어떤 다른 시스템보다 뛰어난 성능을 갖는다.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.95-102
• /
• 2003

Stream servers are for supplying multimedia stream data to users through the internet such as movies and music without discontinuation. A typical stream server is designed roughly by considering the characteristics of stream services and by employing processors, memory, PCI bus, Ethernet, TOE and disks. This study focuses on deciding the priority for using resources such as PCI bus, buffer memory and TOE buffer, which have limited capacities in a typical stream server. When the priorities for using limited resources are not given properly, the stream servers may not even function as originally designed. The simulation study shows that the top priority for using PCI bus for normal streaming services should be given to the operation that sends data from buffer memory to TOE buffer. Giving priority for using PCI bus to other operation such as sending data from disks to memory results in a deadlock phenomenon.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.722-723
• /
• 2017

In this study, we take into account in improving traffic flow in real-time problem. In order to solve the problem, we propose a new approach to manage traffic flow at the intersection in real-time via controlling by traffic light scheduling. In particular, the proposed method is based on process synchronization theory and connected vehicle technology where each vehicle is able to communicate with others. The traffic deadlock is also taken into consideration in case of high traffic volume. The simulation shows the potential results comparing with the existing traffic management system.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.385-396
• /
• 2014

In this paper, we present a formal method for modeling and checking an enhanced version of the carrier sense multiple access with collision avoidance protocol related to the IEEE 802.11 MAC layer, which has been proposed as the standard protocol for wireless local area networks. We deal mainly with the distributed coordination function (DCF) procedure of this protocol throughout a sequence of transformation steps. First, we use the unified modeling language state machines to thoroughly capture the behavior of wireless stations implementing a DCF, and then translate them into the input language of the UPPAAL model checking tool, which is a network of communicating timed automata. Finally, we proceed by checking of some of the safety and liveness properties, such as deadlock-freedom, using this tool.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2775-2777
• /
• 2000

In this thesis, proposed is an algorithm that diminishes Blocking phenomenon and Deadlock phenomenon, as numbers of AGV are running after the consideration of the flexibility of production system and selection of a model in case that a meeting point or an intersection on AGV system paths is equipped, can be reduced by using RF modem and PC(Personal Computer) which gets some information for AGV

• Proceedings of the KSR Conference
• /
• 2003.10c
• /
• pp.581-586
• /
• 2003

As a very important part in development of the protocol, verification and conformance test for protocol specification are complementary techniques that are used to increase the level of confidence in the system functions. as prescribed by their specifications. In this paper, we verify the safety and liveness properties of rail signal control protocol type 1 specified in LTS(Labeled Transition System) with model checking method, and experimentally prove that it is possible to check for the deadlock, livelock and rechability of the states and actions on LTS. We also propose a formal method on generation of conformance test cases using the concept of UIO sequences from verified protocol specification.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1996.05a
• /
• pp.15-15
• /
• 1996

A shop floor control system (SFCS) is the central part of a CIM system used to control the activities of several pieces of manufacturing equipment (e.g., NC machines, robots, conveyors, AGVs, AS/RS). The SFCS receives orders and related process plans, and then performs selecting a specific process routing, allocating resources, scheduling the workpieces, downloading the processing instructions (e.g., RS-274 instructions for NC machines, VAL II programs for robot), monitoring the progress of activities, detecting and recovering from errors, and preparing reports on the status of the manufacturing system. Simulation has been utilized in discovering control policies used for resolving shop floor be control problems such as resource contentions, part dispatching, deadlock. The simulation model must be designed to respond to real-time data coming from a shop floor. However, to rapidly build a realtime simulation model of SFCS cannot be easily accomplished. This talk is to address an automatic program generator of discrete event simulation model for shop floor control from process plans and resource models. The program generator is capable of constructing complete discrete simulation models for multi-product and multi-stage flexible manufacturing systems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.4
• /
• pp.189-196
• /
• 2011

In this paper, we propose a logical control-based actor-critic algorithm as an efficient approach for the approximation of the capacitated fab scheduling problem. We apply the average reward temporal-difference learning method for estimating the relative value functions of system states, while avoiding deadlock situation by Banker's algorithm. We consider the Intel mini-fab re-entrant line for the evaluation of the suggested algorithm and perform a numerical experiment by generating some sample system configurations randomly. We show that the suggested method has a prominent performance compared to other well-known heuristics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.720-723
• /
• 2005

There has been significant progress in the development of timed process algebra for the specification and analysis of real-time systems in recent years. ACSR is a timed process algebra, which supports synchronous timed actions and asynchronous instantaneous events. Timed actions model the usage of shared resources and the passage of time, whereas events allow synchronization between processes. To be able to specify real-time systems more effectively, this paper suggests the notion of probabilities. This paper also illustrates extended PACSR with a typical resource allocation system and its deadlock specification and analysis.