Spatial ordering of messages in a cyclic architecture

Abstract

Spatial ordering of messages can be used fruitfully for the design of distributed systems. For modeling such systems we require a logical framework that includes both spatial andtemporal ordering predicates. In order to illustrate its applicability a distributed K mutual exclusion algorithm is proposed that requires a unidirectional cyclic topology for its implementation. The algorithm uses only point to point communication rather than broadcast. It is shown that the topological ordering of messages is important for its correct operation