Advertisement

A starvation-free solution of the dining philosophers' problem by use of interaction systems

  • Horst Wedde
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)

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.

Keywords

Interaction System Registration Phase Coupling Relation Transitional Structure Neighbour Part 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dijkstra, E.W.: "Co-operating Sequential Processes" in: Programming Languages (ed. Genuys); Academic Press New York 1968Google Scholar
  2. 2.
    Dijkstra, E.W.: "Hierarchical Ordering of Sequential Processes" Acta Informatica 1 (1971); Springer Verlag, Berlin-Heidelberg-New YorkGoogle Scholar
  3. 3.
    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 1978Google Scholar
  4. 4.
    Hoare, C.A.R.: "Communicating Sequential Processes" CACM Vol 21 No. 8 (1978)Google Scholar
  5. 5.
    Ichbiah, J.D.: "Rationale for the Design of the ADA Programming Language" SIGPLAN Notices Vol. 14 No. 6 (1980)Google Scholar
  6. 6.
    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 YorkGoogle Scholar
  7. 7.
    Kraft, N.; Wedde, H.: "Modeling Principles of Formal Communication by Use of Interaction Systems"; Technical Report GMD-ISF 80.08; GMD Bonn 1980Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    Wedde, H.: "Lose Kopplung von Systemkomponenten" Berichte der GMD No. 96, Bonn 1975 (German)Google Scholar
  10. 10.
    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 YorkGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Horst Wedde
    • 1
  1. 1.Gesellschaft für Mathematik und Datenverarbeitung mbH BonnSt. Augustin 1W. Germany

Personalised recommendations