The dynamical systems approach to the analysis of evolutionary strategies considers environments that result in time invariant limit behaviour of the underlying processes. An approximation to the stationary state allows inferring how the algorithms' performance scales with parameters of the problem as well as of the strategies. In this talk we present results obtained by applying the dynamical systems approach to the analysis of the behaviour of evolutionary strategies for several simple constrained problems. A comparison between constraint handling techniques is drawn and the interaction between constraint handling and step size adaptation is examined.