Put and get, primitives for synchronous unreliable message passing

Abstract

Two message passing mechanisms are described. These mechanisms areboth synchronous and unreliable. Within concrete process algebra with 6 operator for priorities these mechanisms, called put and get can be, defined without introducing any new syntax. The properties of put and get are analysed in two pathological communication protocols. In a last section we indicate that the put mechanism can be generalised to a broadcasting mechanism.