Abstract. A method for the development of complex finite state machines (FSMs) from their compositional specifications in the logical language L is proposed. A compositional specification consists of specifications of automata modules and interconnections between them. The FSM being synthesized is obtained by connecting the state transition graphs of modules synthesized from their specifications.

Keywords: module of an algorithm, compositional specification, language L, Σ-FSM, ω-word, operation of connecting modules, designation of a state.