A secure message-passing system for multiprocessors is described, and a formal proof of
deadlock prevention is given. The modelling technique is described, with particular …

FIG.I PMJCESS CONFIGURATION IN EACH NODE Page 1 Microprocessing and
Microprogramming 34 (1992) 103-106 103 North-Holland AVOIDANCE OF DEADLOCK IN LOOP …

The communication structure of a distributed computing system needs careful design if
pathologies, such as deadlock, are to be avoided. This paper is concerned with the …

The programming advantages of output guards in guarded commands are sketched. A
protocol is described which allows the use of guarded commands with both input and output …

This paper reviews the general notion of deadlock (and livelock) in parallel systems based
upon synchronised message passing and relates them to the much worse problem of …

This paper presents a graphical design tool for the construction of multiprocess systems that
are guaranteed free from deadlock, livelock and starvation. The tool is strictly targeted to …

Several examples of deadlock occurring in present day computer systems are given Next,
there is a discussion of the strategms which can be~ sed to deal with the deadlock problem …

When building concurrent systems, it would be useful to have a collection of reusable
processes to perform standard tasks. However, without knowing certain details of the inner …

The design and an implementation overview of a communication system which provides
deadlock-free operation in a tightly coupled messagepassing multicomputer system is …

Messages are increasingly being used for interprocess communication. The problem of
introducing messages into typed languages is considered, and a solution in terms of typed …