Nowadays, most enterprises use web services as a framework for facilitating application-to-application interaction within and across them. Describing behaviour of web services is becoming more and more important. This behaviour can be described by timed business protocols representing the possible sequences of message exchanges. Studying the behaviour of web services by analyzing their timed business protocols is the main contribution of this work. This paper introduces notions of compatibility and replaceability w.r.t. timed business protocols together with the corresponding verification algorithms.