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.
No takes yet. Share an insight, caveat, or question.
Xuesen Lin (2009) studied this question.