An Iterative and Starvation-Free Solution for a General Class of Distributed Control Problems Based on Interaction Primitives
暂无分享,去创建一个
[1] Ernest J. H. Chang. n-Philosophers: An Exercise in Distributed Control , 1980, Comput. Networks.
[2] Brian A. Wichmann,et al. Rationale for the design of the Ada programming language , 1979, SIGP.
[3] Horst F. Wedde,et al. A Starvation-Free Solution of the Dining Philosopher's Problem by Use of Interaction Systems , 1981, MFCS.
[4] Edsger W. Dijkstra,et al. Co-operating sequential processes , 1968 .
[5] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[6] Horst F. Wedde,et al. Modeling a Solution for a Control Problem in Distributed Systems by Restrictions , 1981, Theor. Comput. Sci..
[7] Horst F. Wedde,et al. Inducing Patterns of Behaviour in Distributed System Parts , 1980, MFCS.
[8] Horst F. Wedde,et al. Determining Processes by Violations , 1977, MFCS.
[9] Raymond R. Devillers,et al. A General Mechanism for Avoiding Starvation with Distributed Control , 1978, Inf. Process. Lett..
[10] Józef Winkowski. Protocols of Accessing Overlapping Sets of Resources , 1981, Inf. Process. Lett..