ScholarLens Back to search
2009•2009 IEEE Youth Conference on Information, Computing and TelecommunicationRequires access

Multi-behaviors Finite State Machine

Xuesen Lin

Open publisher page 14 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Finite-state machine, Finite state, Computer science, State (computer science), Key (lock), Core (optical fiber), Extended finite-state machine, Virtual finite-state machine

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Multi-behaviors Finite State Machine — Research Paper | ScholarLens