An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives. (English) Zbl 0511.68013


68N25 Theory of operating systems


Zbl 0383.68030
Full Text: DOI


[1] Chang, E., n-philosophers: an exercise in distributed control, Comput. networks, 2, 71-76, (1980)
[2] Devillers, R.E.; Lauer, P.E., A general mechanism for avoiding starvation with distributed control, Information processing lett., 7, 3, 156-158, (1978) · Zbl 0383.68030
[3] Dijkstra, E.W., Co-operating sequential processes, (), 43-112
[4] Dijkstra, E.W., Hierarchical ordering of sequential processes, Acta informat., 1, 2, 115-138, (1971)
[5] Dijkstra, E.W.; Shaw, B., Aspects of reasoning effectively about distributed systems, Proc. joint IBM/university of Newcastle upon Tyne seminar on distributed systems, (1978), (EWD 625)
[6] Hoare, C.A.R., Communicating sequential processes, Comm. ACM, 21, 8, 666-677, (1978) · Zbl 0383.68028
[7] Ichbiah, J.D., Rationale for the design of the ADA programming language, SIGPLAN notices, 14, 6, (1980)
[8] Kraft, N.; Wedde, H., Inducing patterns of behaviour in distributed system parts, (), 375-386
[9] Kraft, N.; Wedde, H., Modeling principles of formal communication by use of interaction systems, Technical report GMD-ISF 80.08 GMD Bonn, (1980)
[10] Maggiolo-Schettini, A.; Wedde, H.; Winkowski, J., Modelling a solution for a control problem in distributed systems by restrictions, Theoret. comput. sci., 13, 61-83, (1980) · Zbl 0441.68021
[11] Wedde, H., Lose kopplung von systemkomponenten, Berichte der GMD, 96, (1975) · Zbl 0301.68070
[12] Wedde, H., A starvation-free solution for the dining philosophers’ problem by use of interaction systems, (), 534-543
[13] Wedde, H.; Winkowski, J., Determining processes by violations, (), 549-559
[14] Winkowski, J., Protocols of accessing overlapping sets of resources, Information processing lett., 12, 5, 239-243, (1981)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.