Given a model M , consisting of communicating nite state machines (CFSMs), that represents the required behaviour of an implementation I, it is important t o t e s t I against M. This paper considers part of the testing process: checking the transition structure of I against that of M. One possible approach, to checking the transition structure of I, is to generate the product machine from M and then test the global transitions using standard nite state machine test techniques. This approach m a y, h o wever, su er from a combinatorial explosion. Instead, this paper introduces approaches that may a l l o w local states and transitions of I to be checked without the generation of the product machine. The paper then considers the extension of these approaches to the checking of global states. Ke y w o r d s : communicating nite state machines, state checking, testing, constrained identi cation sequences