One way of avoiding unpredictable delays, in a distributed real-time database, is to allow transactions to commit locally. In a system supporting local commit, and delayed propagation of updates, the replication protocol must be based on eventual consistency. In this thesis, we present a bounded-delay replication method which is based on eventual consistency. The approach used is to divide the replication protocol into three different problems; propagation, conflict detection and conflict resolution, where we focus on the conflict detection and resolution mechanism. We have evaluated different eventual consistency protocols and chosen version vectors as the base for the conflict detection algorithm. We introduce a method of separating policy and mechanism in the conflict resolution mechanism, which is based on forward recovery to avoid unnecessary computation. The protocols presented in this work are aimed to be used in the distributed active real-time database system DeeDS. We conclude that the protocol proposed can be used in DeeDS, under the assumption that no partition failures occur.