• Title/Summary/Keyword: nets

Search Result 903, Processing Time 0.027 seconds

A New Method for the Test Scheduling in the Boundary Scan Environment (경계 주사 환경에서의 상호연결 테스트 방법론에 대한 연구)

  • Kim, Hyun-Jin;Shin, Jong-Chul;Kang, Sung-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.669-671
    • /
    • 1998
  • Due to the serial nature of scan chains, the use of the boundary scan chain leads the high application costs. And with 3-state net, it is important to avoid enabling the two drivers in a net. In this paper, the new test method for 3-state nets in the multiple boundary scan chains is presented. This method configures the boundary scan cells as multiple scan chains and the test application time can be reduced. Also three efficient algorithms are proposed for testing the interconnects in a board without the collision of the test data in 3-state nets.

  • PDF

Transformation of UML Diagrams into Interval Temporal Logic and Petri nets for Real-Time Systems Design

  • Gushiken, Ryuji;Nakamura, Morikazu;Kono, Shinji;Onaga, Kenji
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.653-656
    • /
    • 2000
  • We consider, in this paper, a UML-based design support system for real-time systems. However, the UML does not include any notion for verification of timing constraints. We presents transformation algorithms, as a function of the support system, of UML descriptions into Petri nets and Interval Temporal Logic models, which are very powerful for the verification. This paper shows also transformation example for simple elevator system.

  • PDF

A East Public-Key Cryptography Using RSA and T-invariants of Petri Nets

  • Ge, Qi-Wei;Takako Okamoto
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.669-672
    • /
    • 2000
  • This paper deals with cryptography by applying RSA and Petri nets. Firstly, we introduce RSA cryptography and a Petri net based private-key cryptography. Then we propose a new public-key cryptography, Petri Net based Public-Key Cryptography dented as PNPKC, by taking the advantages of these two proposed cryptographys and give an example to show how to apply PNPKC. Finally, we do the comparison between RSA cryptography and PNPKC on security as well as computation order. As the results, the security of PNPKC is as strong as RSA cryptography and further the encryption and decryption of PNPKC are in average 210 times as fast as RSA cryptography from our experimental data.

  • PDF

JOB Scheduling Analysis in FMC using TPN (TPN을 이용한 FMC의 JOB 스케쥴링 분석)

  • 안광수
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.3
    • /
    • pp.13-19
    • /
    • 1999
  • In this paper, we suggests a WIP (Work In Process) of FMC (Flexible Manufacturing Cell) analysis methods based on the TPN (Time Petri Nets) unfolding. Unfolding of PN is a partial order-based method for the verification of concurrent system without the state space explosion. The aim of this work is to formulate the general cyclic state scheduling problem to minimize the WIP to satisfy economical constraints. The method is based on unfolding of the original net into the equivalent acyclic description.

Performance Analysis of Distributed system by Extended Time Petri Nets (확장된 타임 페트리 네트에 의한 분산 시스템의 성능 분석)

  • 송영재;이부영;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.3
    • /
    • pp.207-215
    • /
    • 1989
  • In this Paper prestnting an extended timed Petri net model which Can be used for the performance analysis of Distributed System. An analysis methodology based on a reachiabilitylike approach is prestented efficiency to find out the behaviour of these nets in terms of performance. And the proposed extended timed prtri net models are simulated to show practicability of the accuracy of the extended model in representing system specification.

  • PDF

A Schedulability analysis and Recovery Technique of Real-Time System using TCPN (TCPN을 이용한 실시간 시스템의 스케쥴가능성 분석 및 회복기법)

  • Kim, Chun-Bae;Park, Heung-Bok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2797-2808
    • /
    • 1999
  • Timing Constraint Petri Nets(TCPN) extend petri nets by adding timing constraints, it is provide a formal method for the modeling and analysis of real-time system. A real-time schedulability analysis decide that a set of concurrent processes will always meet its deadline. In this paper, we present TCPN model for real-time system include timing constraints and propose a schedulability analysis algorithm using them. Also, When the TCPN model is unscheduleable under the imposed timing constraints, we propose a recovery technique that will be scheduleable by the system specification modifying or timing constraints relaxing in the optimized time.

  • PDF

A Multistrategy Learning System to Support Predictive Decision Making

  • Kim, Steven H.;Oh, Heung-Sik
    • The Korean Journal of Financial Studies
    • /
    • v.3 no.2
    • /
    • pp.267-279
    • /
    • 1996
  • The prediction of future demand is a vital task in managing business operations. To this end, traditional approaches often focused on statistical techniques such as exponential smoothing and moving average. The need for better accuracy has led to nonlinear techniques such as neural networks and case based reasoning. In addition, experimental design techniques such as orthogonal arrays may be used to assist in the formulation of an effective methodology. This paper investigates a multistrategy approach involving neural nets, case based reasoning, and orthogonal arrays. Neural nets and case based reasoning are employed both separately and in combination, while orthoarrays are used to determine the best architecture for each approach. The comparative evaluation is performed in the context of an application relating to the prediction of Treasury notes.

  • PDF

Task Schedule Modeling using a Timed Marked Graph

  • Ro, Cheul-Woo;Cao, Yang;Ye, Yun Xiang;Xu, Wei
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.636-638
    • /
    • 2010
  • Task scheduling is an integral part of parallel and distributed computing. Extensive research has been conducted in this area leading to significant theoretical and practical results. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, we address task scheduling model using extended timed marked graph, which is a special case of SRNs. And we analyze this model by giving reward measures in SRN.

  • PDF

Study on the characteristics of nucleate boiling heat transfer with changing of surface roughness (표면거칠기의 변화에 따른 핵비등열전달의 특성에 관한 연구)

  • 김춘식;정대인;배종욱
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.7 no.1
    • /
    • pp.64-78
    • /
    • 1983
  • In nucleate boiling, bubbles are created by the expansion of entrapped gas or vapor at small cavities in the surface of heat transfer. Namely, surface roughness is the important factor of heat transfer. This paper deals with the characteristics of boiling curve according to surface roughness. Freon-113 is used as the experimental fluid. The results are as follows; 1. In the case of the same as "q=C$\Delta$T$^{n}$ ", the lower numberical index "n", the larger heat transfer coefficient and the lower wall superheat "$\Delta$T" is obtained for the rougher surface. 2. In the working of every kind of heat transfer sruface with boiling, improvement of capabilities of heat transfer can be devised by adding suitable roughness on the heat transfer surface. 3. When the metal nets of moderate mesh number are established, the capabilities of heat transfer can be improved in evaporation of liquid in vessels. But in the case that the sucession of bubbles in checked by using the nets which are too tight, the generation of bubbles union decreases critical heat flux. decreases critical heat flux.

  • PDF

The Study of Efficiency of System Architecture According to the Modeling of 40G Aladdin System and Input Traffic (40G급 Aladdin 시스템의 모델링 및 입력 트래픽에 따른 시스템 구조 효율성 연구)

  • Hwang, Yu-Dong;Park, Dong-Gue;Jang, Jong-Soo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.4
    • /
    • pp.121-130
    • /
    • 2012
  • In this paper, the structure of the Aladdin system was modeled by Petri nets for performance evaluation of 40G bps class Aladdin system which was developed in ETRI as the high-speed DDoS defensive tool. The efficiency analysis of the system architecture according to the input traffic of the Aladdin system was performed based on the modeling.