In this paper we deal with the problem of integrating components described as Sequential Abstract State Machines. Two operations are defined to compose sequential ASMs and returning a ma hine consistent with respect to updates. Due to their nature, such operations an be used to analyze and handle “behavioral in onsistencies” and to prove omponent and system properties. The applicative aspects of the theoretical issues introduced in the paper are shown by means of three examples: the behavioral description of a telephone system presented in [7],the ASM specification of the Production Cell ase study developed in [3],and the ASM solution of the railroad crossing problem given in [12].