Processes and a fair semantics for the ADA rendez-vous

Processes are mathematical objects which are elements of domains in the sense of Scott and Plotkin. Process domains are obtained as solutions of equations solved by techniques from metric topology as advocated by Nivat. We discuss how such processes can be used to assign meanings to languages with concurrency, culminating in a definition of the ADA rendez-vous. An important intermediate step is a version of Hoare's CSP for which we describe a process semantics and which is used, following Gerth, as target for the translation of the ADA fragment. Furthermore, some ideas will be presented on a mathematically tractable treatment of fairness in the general framework of processes.