What does it mean that a semi-honest adversary can look at the internal state of a controlled party? I have a doubt regarding the definition of (static) semi-honest adversaries. In this tutorial I read:


  Such an adversary controls one of the parties (statically, and so at the onset
  of the computation) and follows the protocol specification exactly. However, it may try to learn
  more information than allowed by looking at the transcript of messages that it received and its
  internal state.


Does it means that, for example, in the case of a commitment scheme a semi-honest adversary, who controls the party supposed to commit a value, knows the committed value (since it is part of her or his internal state)? However, since the adversary is semi-honest, she or he cannot take advantage of this information to deviate from the protocol in a profitable way.
Yes, this is what it means. A semi-honest adversary knows the entire state of each corrupted party, including its input, any random coin tosses, and all incoming messages from all other parties. However, it cannot deviate from the specified protocol instructions. Note that in the multiparty setting, the semi-honest adversary may corrupt multiple parties. In this case, it sees all of the corrupted parties' states together.