A denotational approach to replicated data types

The term weak consistency refers to a family of properties concerning the state of a distributed system. One key issue in their description is the way in which they are specified. In this regard, a major advance is represented by the introduction of replicated data types. However, there exist a few case studies that are studied in the literature and that cannot be formalised as replicated data types. We propose a new mechanism for system specification that accounts also for those cases. Furthermore, we precisely characterise the relationships of our proposal with replicated data types.