• Title/Summary/Keyword: discrete event systems

Search Result 269, Processing Time 0.022 seconds

Development of a Windows-based Program for Discrete Event Simulation of Truck-Loader Haulage Systems in an Underground Mine (지하광산 트럭-로더 운반시스템의 이산 사건 시뮬레이션을 위한 Windows용 프로그램 개발)

  • Choi, Yosoon;Park, Sebeom;Lee, Sung-Jae;Baek, Jieun;Jung, Jihoo;Park, Han-Su
    • Tunnel and Underground Space
    • /
    • v.26 no.2
    • /
    • pp.87-99
    • /
    • 2016
  • We developed a Windows-based program for discrete event simulation of truck-loader haulage systems in an underground mine. The Daesung MDI limestone mine located in Samcheok City, Gangwon Province, Korea was selected as the study area to design the program. The developed program is composed of the graphic user interface (GUI) and simulation engine implemented by Visual Basic.NET 2012 and the GPSS/H simulation language, respectively. When a user sets up input parameters for the discrete event simulation through GUI, the program activates the simulation engine, and then simulation results are displayed on GUI. This paper describes the details of the program development as well as its applications to the study area to determine the optimal number of trucks dispatched at each loading point under different operating conditions.

Structured DEVS Formalism: A Structural Modelling Method of Discrete Event Systems (Structured DEVS Formalism: 이산사건 시스템의 구조적 모델링 기법)

  • Song, Hae-Sang
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.2
    • /
    • pp.19-30
    • /
    • 2012
  • In recent decades, it has been known that the Discrete Event System Specification, or DEVS, formalism provides sound semantics to design a modular and hierarchical model of a discrete event system. In spite of this benefit, practitioners have difficulties in applying the semantics to real-world systems modeling because DEVS needs to specify a large size of sets of events and/or states in an unstructured form. To resolve the difficulties, this paper proposes an extension of the DEVS formalism, called the Structured DEVS formalism, with an associated graphical representation, called the DEVS diagram, by means of structural representation of such sets based on closure property of set theory. The proposed formalism is proved to be equivalent to the original DEVS formalism in their model specification, yet the new formalism specifies sets in a structured form with a concept of phases, variables and ports. A simplified example of the structured DEVS with the DEVS diagram shows the effectiveness of the proposed formalism which can be easily implemented in an objected-oriented simulation environment.

Script-based Test System for Rapid Verification of Atomic Models in Discrete Event System Specification Simulation

  • Nam, Su-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.5
    • /
    • pp.101-107
    • /
    • 2022
  • Modeling and simulation is a technique used for operational verification, performance analysis, operational optimization, and prediction of target systems. Discrete Event System Specification (DEVS) of this representative technology defines models with a strict formalism and stratifies the structures between the models. When the atomic DEVS models operate with an intention different the target system, the simulation may lead to erroneous decision-making. However, most DEVS systems have the exclusion of the model test or provision of the manual test, so developers spend a lot of time verifying the atomic models. In this paper, we propose a script-based automated test system for accurate and fast validation of atomic models in Python-based DEVS. The proposed system uses both the existing method of manual testing and the new method of the script-based testing. As Experimental results in our system, the script-based test method was executed within 24 millisecond when the script was executed 10 times consecutively. Thus, the proposed system guarantees a fast verification time of the atomic models in our script-based test and improves the reusability of the test script.

A NESTING APPROACH IN DISCRETE EVENT SIMULATION FOR INTEGRATING CONSTRUCTION OPERATION AND SCHEDULE MODELS

  • Chang-Yong Yi;Chan-Sik Park;Doo-Jin Lee;Dong-Eun Lee
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.400-408
    • /
    • 2009
  • Simulation applications for analyzing the productivity of construction operations at operation level and project schedules at project level are crucial methods in project management. The application at two different levels should be very tightly linked to each other in practice. However, appropriate integration at the levels is not achieved in that existing systems do not support to integrate operation models into a schedule model. This paper presents a new approach named to Discrete Event Simulation-Nesting modeling approach, which supports not only productivity analysis at operation level but also schedule management at a project level. The system developed by the authors allows creating operation models at the operation level, maintaining them in operation model library, executing sensitivity analysis to find the behaviors of the operation models when different combination of resources are used as existing DES systems do. On top of the conventional functions, the new system facilitates to find the optimum solution of resource combinations which satisfy the user's interest by computing the hourly productivity and the hourly cost of the operation. By drag-and-dropping an operation model kept in the operation model library, the operation models are integrated into an activity of the schedule model. When a complete schedule model is established by nesting operation models into the schedule model, stochastic simulation based scheduling is executed. A case study is presented to demonstrate the new simulation system and verify the validity of the system.

  • PDF

Maximum Allowable Delay Bounds and Real-time Scheduling Method of Networked Discrete-time Control Systems (네트워크 기반 이산 시간 제어 시스템의 최대 허용 지연 한계 및 실시간 스케줄링 기법에 관한 연구)

  • Kim Dong-Sung;Choi Dong-Hyuk
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.7
    • /
    • pp.719-727
    • /
    • 2006
  • This paper proposes a new method to obtain a maximum allowable delay bound for a scheduling of networked discrete control systems and event-based scheduling method. The proposed method is formulated in terms of linear matrix inequalities and can give a much less conservative delay bound than the existing methods. A network scheduling method is presented based on the delay obtained through the proposed method, and it can adjust the sampling period to allocate same utilization to each control loop. The presented method can handle three types of data (sporadic, emergency data, periodic data and non real-time message) and guarantees real-time transmission of periodic and sporadic emergency data using modified EDF scheduling method.

Failure Diagnosis of pressurizer in PWR (PWR의 가압기 고장진단)

  • Park, J. H.;Lee, D. H.;lee, S.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.474-477
    • /
    • 2002
  • Safety is very important to operate nuclear power plant. To guarantee the safety, nuclear power plant should be run without trouble. This paper presents the application of a failure diagnosis approach based on discrete event system theory to the pressurizer pressure control system for Pressurized Water Reactor. Also, this paper shows a scheme of failure diagnosis by distributed diagnoser.

  • PDF

a linear system approach

  • 이태억
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.10a
    • /
    • pp.118-118
    • /
    • 1993
  • We consider a discrete event dynamic system called periodic job shop, where an identical mixture of items called minimal part set(MPS) is repetitively produced in the same processing order and the primary performance measure is the cycle time. The precedence relationships among events(starts of operations) are represented by a directed graph with rocurront otructure. When each operation starts as soon as all its preceding operations complete(called earliest starting), the occurrences of events are modeled in a linear system using a special algebra called minimax algebra. By investigating the eigenvalues and the eigenvectors, we develop conditions on the directed graph for which a stable steady state or a finite eigenvector exists. We demonstrate that each finite eigenvector, characterized as a finite linear combination of a class of eigenvalue, is the minimum among all the feasible schedules and an identical schedule pattern repeats every MPS. We develop an efficient algorithm to find a schedule among such schedules that minimizes a secondary performance measure related to work-in-process inventory. As a by-product of the linear system approach, we also propose a way of characterizing stable steady states of a class of discrete event dynamic systems.

  • PDF

Verification and Evaluation of Spatial Structure Theory through Discrete Event Simulation (이산사건 시뮬레이션을 이용한 공간구조론의 검증 및 평가)

  • Yoon, So Hee;Kim, Suk Tae
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.12
    • /
    • pp.2000-2013
    • /
    • 2016
  • The purpose of this study is to validate the validity of the methodology for analyzing the space with complex characteristics and to evaluate the existing spatial structure analysis theory. Seven example models are designed and analyzed data of spatial syntax analysis and visibility graph analysis. And analyzed the agent-based model using two analytical methods: the adjacent space and the whole spatial connection. The results of this study are as follows. Based on the analysis of the agent - based model for perfectly freewalking, the validity of the method is verified in terms of predictive ability and effectiveness. Agent-based models can be simulated considering various variables, so realistic predictions will be possible and a new biography of complex systems can be met.

Design and Implementation of the DEVS-based Distributed Simulation Environment: D-DEVSim++ (DEVS에 기반한 분산 시뮬레이션 환경 $D-DEVSim^{++}$의 설계 및 구현)

  • 김기형
    • Journal of the Korea Society for Simulation
    • /
    • v.5 no.2
    • /
    • pp.41-58
    • /
    • 1996
  • The Discrete Event Systems Specification(DEVS) formalism specifies a discrete event system in a hierarchical, modular form. This paper presents a distributed simulation environment D-DEVSim++ for models specified by the DEVS formalism. D-DEVSim++ employs a new simulation scheme which is a hybrid algorithm of the hierarchical simulation and Time Warp mechanisms. The scheme can utilize both the hierarchical scheduling parallelism and the inherent parallelism of DEVS models. This hierarchical scheduling parallelism is investigated through analysis. Performance of the proposed methodology is evaluated through benchmark simulation on a 5-dimensional hypercube parallel machine. The performance results indicate that the methodology can achieve significant speedup. Also, it is shown that the analyzed speedup for the hierarchical scheduling time corresponds the experiment.

  • PDF

Simulation of a Mobile IoT System Using the DEVS Formalism

  • Im, Jung Hyun;Oh, Ha-Ryoung;Seong, Yeong Rak
    • Journal of Information Processing Systems
    • /
    • v.17 no.1
    • /
    • pp.28-36
    • /
    • 2021
  • This paper proposes two novel methods to model and simulate a mobile Internet of Things (IoT) system using the discrete event system specification (DEVS) formalism. In traditional simulation methods, it is advantageous to partition the simulation area hierarchically to reduce simulation time; however, in this case, the structure of the model may change as the IoT nodes to be modeled move. The proposed methods reduce the simulation time while maintaining the model structure, even when the IoT nodes move. To evaluate the performance of the proposed methods, a prototype mobile IoT system was modeled and simulated. The simulation results show that the proposed methods achieve good performance, even if the number of IoT nodes or the movement of IoT nodes increases.