Systems employing technics of distributing data across multiple machines are widespread nowadays and demand significant expertise from operators. Oftentimes requirement of strong consistency from the data store is too expensive and unaffordable in practical systems. One of the approaches is an application of partial quorum systems with weaker consistency guarantees. Probabilistically Bounded Staleness (PBS) was introduced together with t-visibility consistency. The WARS model based on mentioned above theory is deliberated to give a tool to reason about data consistency by bounding a staleness of data. Further studying the PBS approach is a step towards better understanding and providing reasoning about consistency in distributed systems with partial quorums. The work presented in this paper is a proposition of an enhanced WARS model backed by experimental data to get a more precise view of a system.