Time is an important parameter in modeling and analyzing Web services. A Web service can be represented by its behavior which can be described by a business protocol representing the possible sequences of message exchanges. Automated analyses of timed Web services, such as compatibility checking, are very difficult and in some cases are not possible in the presence of implicit transitions (internal transitions) based on time constraints. The source of this difficulty is the semantics of implicit transitions, because most of the wellknown modeling tools do not allow expressing such semantics (e.g., epsilon transition on timed automata has different semantics). This paper presents an approach for removing complex implicit transitions of timed business protocols before performing the interoperability analysis without changing the semantics of the protocols.