This paper describes the state machines introduced in Modelica 3.3. Any block without continuous-time equations or algorithms can be a state of a state machine. Transitions between such blocks are new kind of connections associated with transition conditions. The paper gives the details for building state machines and includes many examples. In addition; the complete semantics is described using only 13 Modelica equations.
Keywords: Modelica; State Machines; Control