On Mereologies in Computing Science

Abstract

In this paper we solve the following problems: ∙ We give a formal model of a large class of mereologies, with simple entities modelled as parts and their relations by connectors. ∙ We show that class applies to a wide variety of societal infrastructure component domains. ∙ We show that there is a class of CSP channel and process structures that correspond to the class of mereologies where mereology parts become CSP processes and connectors become channels; and where simple entity attributes become process states. We have yet to prove to what extent the models satisfy the axiom systems for mereologies of, for example, [12] and a calculus of individuals [13]. Mereology is the study, knowledge and practice of part-hood relations: of the relations of part to whole and the relations of part to part within a whole. By parts we shall here understand simple entities – of the kind illustrated in this paper. Manifest simple entities of domains are either continuous (fluid, gaseous) or discrete (solid, fixed), and if the latter, then either atomic or composite. It is how the sub-entities of a composite entity are “put together” that “makes up” a mereology of that composite entity – at least such as we shall study the mereology concept. In this paper, we shall study some ways of modelling the mereology of composite entities. One way of modelling mereologies is using sorts, observer functions and axioms (McCarthy style), another is using CSP.