• Title/Summary/Keyword: Finite State Machines

Search Result 64, Processing Time 0.021 seconds

Decomposition of transformation semigroups

  • 김석태
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.2
    • /
    • pp.103-106
    • /
    • 2000
  • We introduce the concepts of TL-finite state machines TL-transformation semigroups and coverings and several decompositions of transformation semigroups and investigate some their algebraic structures.

  • PDF

Robust State Feedback Control of Asynchronous Machines with Intermittent Faults (간헐 고장이 존재하는 비동기 머신의 견실한 상태 피드백 제어)

  • Yang, Jung-Min
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.48 no.3
    • /
    • pp.40-47
    • /
    • 2011
  • This paper addresses the problem of fault detection and tolerance for asynchronous sequential machines using state feedback control. The considered asynchronous machine is affected by intermittent faults. When intermittent faults occur, the machine undergoes unauthorized state transitions and, for a finite duration, remains at the fault state, not responding to the change of the external input. In this paper, we postulate the scheme of detecting intermittent faults and present the existence condition and design algorithm for a robust state feedback controller that overcomes the adversarial effect of intermittent faults. We also undertake a comparative study between the previous control scheme for transient faults and the present strategy for intermittent faults. The design procedure for the proposed controller is described in a case study.

A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection

  • Kim, HyunJin;Lee, Seung-Woo
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.154-157
    • /
    • 2013
  • This letter proposes a memory-based parallel string matching engine using the compressed state transitions. In the finite-state machines of each string matcher, the pointers for representing the existence of state transitions are compressed. In addition, the bit fields for storing state transitions can be shared. Therefore, the total memory requirement can be minimized by reducing the memory size for storing state transitions.

Corrective Control of Input/Output Asynchronous Sequential Machines for Overcoming Disturbance Inputs (외란 입력을 극복하기 위한 입력/출력 비동기 머신의 교정 제어)

  • Yang, Jung-Min;Kwak, Seong-Woo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.3
    • /
    • pp.591-597
    • /
    • 2009
  • The problem of controlling a finite-state asynchronous sequential machine is examined. The considered machine is governed by input/output control, where access to the state of the machine is not available. In particular, disturbance inputs can infiltrate into the asynchronous machine and provoke unauthorized state transitions. The control objective is to use output feedback to compensate the machine so that the closed-loop system drive the faulty asynchronous machine from a failed state to the original one. Necessary and sufficient condition for the existence of appropriate controllers are presented in a theoretical framework. As a case study, the closed-loop system of an asynchronous machine with the proposed control scheme is implemented in VHDL code.

FSM Synthesis from High-Level Descriptions (상위 수준 기술로부터 순차 회로의 자동 생성)

  • 황선영;유진수
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.12
    • /
    • pp.1906-1915
    • /
    • 1990
  • A synthesis system generating sequential circuits from a high-level hardware descdription language CHDL, modelling language for Thor functional/behavioral simulator, is developed. In this paper, we describe the semantic analysis process, state minimization and state assignment algorithms. proposed assignment algorithm generates optimal state vectors using constraint matrix and similarity graph. Expremental results for MCNC benchmarks, standard test circuits, show that the system inplementing the proposed algorithms can be a viable tool for designing large finite state machines.

  • PDF

Harmonic Winding Factors and MMF Analysis for Five-phase Fractional-slot Concentrated Winding PMSM

  • Kang, Huilin;Zhou, Libing;Wang, Jin
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.3 no.1
    • /
    • pp.20-26
    • /
    • 2014
  • To enhance torque density by harmonic current injection, optimal slot/pole combinations for five-phase permanent magnet synchronous motors (PMSM) with fractional-slot concentrated windings (FSCW) are chosen. The synchronous and the third harmonic winding factors are calculated for a series of slot/pole combinations. Two five-phase PMSM, with general FSCW (GFSCW) and modular stator FSCW (MFSCW), are analyzed and compared in detail, including the stator structures, star of slots diagrams, and MMF harmonic analysis based on the winding function theory. The analytical results are verified by finite element method, the torque characteristics and phase back-EMF are also taken into considerations. Results show that the MFSCW PMSM can produce higher average torque, while characterized by more MMF harmonic contents and larger ripple torque.

Supervisory Control of Discrete Event Systems (이산현상시스템의 관리제어기법에 관한 연구 - 분산시스템의 병렬제어 응용 -)

  • Lee, Joon-Hwa;Kwon, Wook-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.310-312
    • /
    • 1993
  • We present the discrete event systems modeled by finite state machines in this paper using the boolean matrices and vectors. We propose a supervisor synthesis method for such boolean discrete-event systems. The proposed supervisor synthesis algorithm is practically implementable, since the size of the state vector in the product system does not increase exponentially with the number of components.

  • PDF

Equivalence Checking of Finite State Machines with SMV (SMV를 이용한 유한 상태 기계의 동치 검사)

  • 권기현;엄태호
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.7_8
    • /
    • pp.642-648
    • /
    • 2003
  • In this paper, we are interested in checking equivalence of FSMs(finite state machines). Two FSMs are equivalent if and only if their responses are always equal with each other with respect to the same external stimuli. Equivalence checking FSMs makes complicated FSM be substituted for simpler one, if they are equivalent. We can also determine the system satisfies the requirements, if they are all written in FSMs. In this paper, we regard equivalence checking problem as model checking one. For doing so, we construct the product model $M ={M_A} {\beta}{M_B} from two FSMs ${M_A} and {M_B}$. And we also get the temporal logic formula ${\Phi}$ from the equivalence checking definition. Then, we can check with model checker whether if satisfies ${\Phi}$, written $M= {.\Phi}$. Two FSMs are equivalent, if $M= {.\Phi}$ Otherwise, it is not equivalent. In that case, model checker generates counterexamples which explain why FSMs are not equivalent. In summary, we solve the equivalence checking problem with model checking techniques. As a result of applying to several examples, we have many satisfiable results.

A New Immunotronic Approach to Hardware Fault Detection Using Symbiotic Evolution (공생 진화를 이용한 Immunotronic 접근 방식의 하드웨어 오류 검출)

  • Lee, Sang-Hyung;Kim, Eun-Tai;Lee, Hee-Jin;Park, Mignon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.5
    • /
    • pp.59-68
    • /
    • 2005
  • A novel immunotronic approach to fault detection in hardware based on symbiotic evolution is proposed in this paper. In the immunotronic system, the generation of tolerance conditions corresponds to the generation of antibodies in the biological immune system. In this paper, the principle of antibody diversity, one of the most important concepts in the biological immune system, is employed and it is realized through symbiotic evolution. Symbiotic evolution imitates the generation of antibodies in the biological immune system morethan the traditional GA does. It is demonstrated that the suggested method outperforms the previous immunotronic methods with less running time. The suggested method is applied to fault detection in a decade counter (typical example of finite state machines) and MCNC finite state machines and its effectiveness is demonstrated by the computer simulation.

Predictions of Short-Circuit Characteristics of Rotor Windings in a Generator using Electromagnetic Analysis (전자장해석을 통한 발전기 회전자권선 단락특성 예측)

  • Kim, Dong-Hun;Song, Myung-Kon;Park, Jung-Shin;Lee, Dong-Young
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.55 no.11
    • /
    • pp.572-576
    • /
    • 2006
  • As the increasing of capacity and technology of power facilities, rotating machines such as turbine generators and water turbines are getting higher at capacity but smaller in size. Thus the monitoring and diagnosis of generators for fault detection and protection has attracted intensive interest. Most of electrical faults of rotating machines appear in their windings. In case of an after-fault in high capacity rotating machines, the recovering cost is usually very expensive and additional time is necessary for returning in a normal situation. In this paper, the magnetic flux patterns in air-gap of a generator under various fault states as well as a normal state are simulated by a conventional FEM tool. These results are successfully applied to detection and diagnosis of the short-circuit condition in rotor windings of a high capacity generator.