Abstract: This paper analyses the semantics of CFSM model and provides an algorithm of transforming a CFSM model to finite automata. The main idea is to simulate the asynchronous behaviors of CFSM by constructing some synchronous automata including a main controller automaton, some input automata and some output automata. The result paves the way for further analysis and verification of CSFM models in terms of traditional finite automata.