Abstract
For an independent and graphical representation of the constraints in distributed system parts the formalism of Loosely Coupled Systems (LCS) is recalled. The events in these structures are formally derived from symmetrical local restrictions. How the interaction between neighbour parts influences processes in these parts is then adequately described by a symmetrical transitional structure (slack of behaviour) in each part. In order also to represent further types of influence local excitement relations are introduced by means of which we can determine directions for processes in system parts and force them to leave a given local state. The formally extended system structures are called Interaction Systems (IS). — A solution of the Dining Philosophers' Problem recently given by Dijkstra [3] is briefly discussed. In order to demonstrate the flexibility and representational power of our graphical structures we then derive a starvation-free solution for that problem in a stepwise procedure. We do not assume a global finite-delay property.
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: "Co-operating Sequential Processes" in: Programming Languages (ed. Genuys); Academic Press New York 1968
Dijkstra, E.W.: "Hierarchical Ordering of Sequential Processes" Acta Informatica 1 (1971); Springer Verlag, Berlin-Heidelberg-New York
Dijkstra, E.W.: "Aspects of Reasoning Effectively about Distributed Systems" (EWD 625), in: B. Shaw (ed.): Proc.of the Joint IBM / University of Newcastle upon Tyne Seminar on Distributed Computing Systems, Sept. 1978; University of Newcastle upon Tyne Computing Laboratory 1978
Hoare, C.A.R.: "Communicating Sequential Processes" CACM Vol 21 No. 8 (1978)
Ichbiah, J.D.: "Rationale for the Design of the ADA Programming Language" SIGPLAN Notices Vol. 14 No. 6 (1980)
Kraft, N.; Wedde, H.: "Inducing Patterns of Behaviour in Distributed System Parts", in: P.Dembiński (ed.): Springer Lecture Notes in Computer Science, Vol.88 (1980), Berlin-Heidelberg-New York
Kraft, N.; Wedde, H.: "Modeling Principles of Formal Communication by Use of Interaction Systems"; Technical Report GMD-ISF 80.08; GMD Bonn 1980
Maggiolo-Schettini, A.; Wedde, H.; Winkowski, J.: "Modelling a Solution for a Control Problem in Distributed Systems by Restrictions", TCS 13 (1981), pp 61–83, North Holland Publ.Comp.
Wedde, H.: "Lose Kopplung von Systemkomponenten" Berichte der GMD No. 96, Bonn 1975 (German)
Wedde, H.; Winkowski, J.: "Determining Processes by Violations" MFCS'77 Symp. in Tatranska Lomnica, in: J. Gruska (ed.): Springer Lecture Notes in Computer Science 53 (1977), Springer Verlag Berlin-Heidelberg-New York
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wedde, H. (1981). A starvation-free solution of the dining philosophers' problem by use of interaction systems. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_122
Download citation
DOI: https://doi.org/10.1007/3-540-10856-4_122
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10856-6
Online ISBN: 978-3-540-38769-5
eBook Packages: Springer Book Archive