A distributed computation satisfies sequential consistency if it is possible to establish a legal ordering of all the operations such that the program order of each site in the distributed system is respected.However,sequential consistency does not necessarily consider the particular real-time instant at which each operation is executed. A timed consistency model addresses how quickly the effects of an operation are perceived by the rest of the system, by requiring that if a write operation is executed at time t , it must be visible to the entire distributed system by time t + Δ. Timed consistency generalizes several existing consistency criteria and it is well suited for applications where the action of one user must be seen by others in a timely fashion.