Bisimilarity and Trace Equivalence in Labelled Transition Systems
The answer is that the LTS on the left isn't deterministic, as the label (or action) open_door doesn't go to a single state and hence that action is non-deterministic.

This example shows that determinism is indeed required for trace equivalence and bisimilarity to be equivalent.