• DocumentCode
    3134304
  • Title

    Multi-behaviors Finite State Machine

  • Author

    Lin, Xuesen

  • fYear
    2009
  • fDate
    20-21 Sept. 2009
  • Firstpage
    201
  • Lastpage
    203
  • Abstract
    A classic finite state machine (FSM) is a model of behavior composed of a finite number of states, transitions between those states, and actions. However, there are some cases where two or more behaviors are contained in one FSM, which is referred as multi-behaviors finite state machine (MFSM) in this paper. Among these behaviors, some of their states differ from each other while others don´t. How to distinct those differences as well as to keep and take advantage of their similarities would be a key to the management of this special type of finite state machine. This paper presents you some of the core characteristics of a MFSM at first, and then illustrates the practical implementation. In addition, some engineering experiences gained from real practices are provided.
  • Keywords
    finite state machines; FSM; actions; multibehaviors finite state machine; states; transitions; Application software; Automata; Cleaning; Digital systems; Filling; Hardware; Load modeling; Operating systems; Sections; Software engineering; Finite state machines; modeling and implementation; multiple behaviors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information, Computing and Telecommunication, 2009. YC-ICT '09. IEEE Youth Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-5074-9
  • Electronic_ISBN
    978-1-4244-5076-3
  • Type

    conf

  • DOI
    10.1109/YCICT.2009.5382390
  • Filename
    5382390