An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives

Horst Wedde
1983 Theoretical Computer Science  
For an independent and Graphical representation of the constraints in distributed system parts the fti,r malism of Loo.wl~ Coupled Sy.wlns is recalled. The events in thcsc structures are formally derived from symmetrical bilateral restrictions. How the interaction between neighbouring parts influences processes in these parts is then adequately described by a symmetrical transitional structure (slack of hehaciour) in each part. In order also to represent asymmetrical types of influence locczl
more » ... citement rdatiorzs are introduced by means of which we can determine directions of flow and can force processes to leave a siven local stats. The formally extended system structures are called It~tt~ractmn Systems (IS). A solution of the Dining Philosophers' Problem given by Dijkstra in [S] is briefly discussed. In order to demonstrate the flexibility and representational power of our graphical tools we then derive a starvation-free solution for that problem in a s:cp~*i.w procedure. (We do not assume a global finite-delay property.) We roconsidcl :I general problem for distributed processes which access shared resources 12. 131. The solution scheme for the special case of Dijkstra's problem applies at once to thr general case. The star vation-freeness of the solution is proved. L
doi:10.1016/0304-3975(83)90127-5 fatcat:jgzexvaphvbqnayccjrqvh2xyq