Communicating sequential processes
Communicating sequential processes
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
Avoidance of deadlock in loop structures—a two process solution
Euromicro 91 Proceedings of the seventeenth Euromicro conference on Software and hardware : specification and design: specification and design
Ordering of events in two-process concurrent system
ACM SIGSOFT Software Engineering Notes
Weakest precondition based verification tool that models spatial ordering
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
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