• Title/Summary/Keyword: state transition diagram

Search Result 74, Processing Time 0.027 seconds

Derivation of State Transition Diagram from Class Using Tree Structure (트리 형태를 이용한 클래스의 단계별 상태 다이어그램 도출 기법에 대한 연구)

  • Choi, Soo Kyung;Park, Young Bom
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.1
    • /
    • pp.19-26
    • /
    • 2013
  • To improve the reliability and quality of software system, many studies of the testing based on state-transition diagram have been in progress. Existing studies tried to solve the complexity problem of state-transition diagram. But the development of test case demands the better way to derive and manage the state diagram with low complexity. In this paper, the STMT(State-Transition Mapping Tree) is proposed to decrease the complexity of state diagram without changing or loosing the original state or transition information. Comparing with other methods, the proposed method turns out to be less complex.

ALGORITHM FOR THE CONSTRUCTION OF THE STATE TRANSITION DIAGRAM OF A SACA OVER GF($2^p$)

  • Choi, Un-Sook;Cho, Sung-Jin
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1331-1342
    • /
    • 2009
  • In this paper, we analyze the behavior of the state transition of nongroup CA with a single attractor over GF($2^p$)(p > 1), and propose the algorithm for the construction of the state transition diagram of a Single Attractor CA(SACA) over GF($2^p$) which is very different from the construction algorithm for the state transition diagram of GF(2) SACA.

  • PDF

The Analysis of State-Transition of SACA over GF(2p) (GF(2p) 위에서의 SACA의 상태전이 분석)

  • Cho Sung-Jin;Hwang Yoon-Hee;Kim Han-Doo;Pyo Yong-Soo;Choi Un-Sook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.2
    • /
    • pp.105-111
    • /
    • 2005
  • Though GF(2) CA can only handle data with bit units GF(2p) CA can handle data with units more than bit units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2p). And we propose the constructing method the state-transition diagram of a linear SACA over GF(2p) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.

Estimating the Glass Transition of Oligosaccharides Mixtures through the State Diagram

  • Auh, Joong-Hyuck;Park, Kwan-Hwa
    • Food Science and Biotechnology
    • /
    • v.14 no.2
    • /
    • pp.301-303
    • /
    • 2005
  • State diagram of highly concentrated branched oligosaccharides (HBOS) was constructed to better understand phase behavior of mixtures with different size of oligosaccharides. It showed dramatic plasticizing effect on glass transition, which was successfully described based on Couchman-Karasz equation model. $T_g$' estimated from state diagram corresponded well with previous empirical data measured by maximum ice formation through isothermal holding (annealing) process. Estimated $T_g$' and $C_g$' values were $-36.3^{\circ}C$ and 79.99%, respectively. $T_g$' value of HBOS was approximately $10^{\circ}C$ higher than that of sucrose, while $C_g$' value was similar to those of general carbohydrate materials, which could be useful for applications in frozen system.

Tracking Object Movement via Two Stage Median Operation and State Transition Diagram under Various Light Conditions

  • Park, Goo-Man
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.4
    • /
    • pp.11-18
    • /
    • 2007
  • A moving object detection algorithm for surveillance video is here proposed which employs background initialization based on two-stage median filtering and a background updating method based on state transition diagram. In the background initialization, the spatiotemporal similarity is measured in the subinterval. From the accumulated difference between the base frame and the other frames in a subinterval, the regions affected by moving objects are located. The median is applied over the subsequence in the subinterval in which regions share similarity. The outputs from each subinterval are filtered by a two-stage median filter. The background of every frame is updated by the suggested state transition diagram The object is detected by the difference between the current frame and the updated background. The proposed method showed good results even for busy, crowded sequences which included moving objects from the first frame.

Deadlock Detection of Software System Using UML State Machine Diagram (UML State Machine Diagram을 이용한 소프트웨어 시스템의 데드락 탐지)

  • Min, Hyun-Seok
    • Journal of Convergence Society for SMB
    • /
    • v.1 no.1
    • /
    • pp.75-83
    • /
    • 2011
  • Unified Modeling Language (UML) is widely accepted in industry and particularly UML State Machine Diagram is popular for describing the dynamic behavior of classes. This paper discusses deadlock detection of System using UML State Machine Diagram. Since a State Machine Diagram is used for indivisual class' behavior, all the State Machine Diagrams of the classes in the system are combined to make a big system-wide State Machine Diagram to describe system behavior. Generally this system-wide State Machine Diagram is very complex and contains invalid state and transitions. To make it a usable and valid State Machine Diagram, synchronization and externalization are applied. The reduced State Machine Diagram can be used for describing system behavior thus conventional model-checking technique can be applied. This paper shows how deadlock detection of system can be applied with simple examples. All the procedures can be automatically done in the tool.

  • PDF

Bifurcation analysis of budding yeast cell cycle

  • Nguyen, Cuong;Yoon, Chang-No;Kim, Hak-Yong;Han, Seung-Kee
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2004.11a
    • /
    • pp.50-56
    • /
    • 2004
  • Bifurcation analysis of cell cycle regulation in the budding yeast is performed basedon the mathematical model by Chen et al [Molecular biology of cell, 11:369-391, 2000]. On the bifurcation diagram, locations of both stable and unstable solutions of the nonlinear differential equations are presented by taking the mass of cell as a controlparameter. Based on the bifurcation diagram, dynamic mechanism underlying the 'start' transition, initiation of a new round of cell cycle, and the 'finish' transition, completion of cell cycle and returning back to the initial state, is discussed: the 'start' transition is a transition from a stable fixed solution for a small mass and to an oscillatory state for a large mass, and the 'finish' transition is a switching back to the stable fixed solution from the oscillatory state. To understand the role of the genes during the cell cycle regulation, bifurcation diagrams for the mutants are compared with that of the wild type.

  • PDF

Characterization of SACA over GF(2$^{p}$) (GF(2$^{p}$) 위에서의 SACA의 특성화)

  • Choi, Un-Sook;Cho, Sung-Jin;Hwang, Yoon-Hee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.335-338
    • /
    • 2005
  • Though GF(2) CA can only handle data with bit units, GF(2$^{p}$) CA can handle data with byte units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2$^{p}$). And we propose the constructing method of the state-transition diagram of a linear SACA over GF(2$^{p}$) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.

  • PDF

Identifying Security Requirement using Reusable State Transition Diagram at Security Threat Location (보안 위협위치에서 재사용 가능한 상태전이도를 이용한 보안요구사항 식별)

  • Seo Seong-Chae;You Jin-Ho;Kim Young-Dae;Kim Byung-Ki
    • The KIPS Transactions:PartD
    • /
    • v.13D no.1 s.104
    • /
    • pp.67-74
    • /
    • 2006
  • The security requirements identification in the software development has received some attention recently. However, previous methods do not provide clear method and process of security requirements identification. We propose a process that software developers can build application specific security requirements from state transition diagrams at the security threat location. The proposed process consists of building model and identifying application specific security requirements. The state transition diagram is constructed through subprocesses i) the identification of security threat locations using security failure data based on the point that attackers exploit software vulnerabilities and attack system assets, ii) the construction of a state transition diagram which is usable to protect, mitigate, and remove vulnerabilities of security threat locations. The identification Process of application specific security requirements consist of i) the analysis of the functional requirements of the software, which are decomposed into a DFD(Data Flow Diagram; the identification of the security threat location; and the appliance of the corresponding state transition diagram into the security threat locations, ii) the construction of the application specific state transition diagram, iii) the construction of security requirements based on the rule of the identification of security requirements. The proposed method is helpful to identify the security requirements easily at an early phase of software development.