This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allows to describe and analyze both locally temporal and behavioral properties of distributed objects and interactions among them. We introduce timed bisimulations with respect to local time. These bisimulations equate distributed objects if and only if their behaviors are completely matched and their timings are within a given bound. The bisimulations provide a method to verify distributed objects with temporal uncertainties and real-time objects with non-strict time constraints.