{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:29Z","timestamp":1725663389422},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540516873"},{"type":"electronic","value":"9783540467502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51687-5_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:13:19Z","timestamp":1330186399000},"page":"83-93","source":"Crossref","is-referenced-by-count":8,"title":["An efficient solution to the drinking philosophers problem and its extensions"],"prefix":"10.1007","author":[{"given":"David","family":"Ginat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Udaya","family":"Shankar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. K.","family":"Agrawala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"M. Chandy","year":"1984","unstructured":"Chandy, M. and Misra, J., \u201cThe drinking philosophers problem,\u201d ACM Trans. Prog. Lang. Syst., Vol. 6, 4, Oct. 1984, pp. 632\u2013646.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"issue":"3","key":"8_CR2","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/5956.5958","volume":"8","author":"M. Chandy","year":"1986","unstructured":"Chandy, M. and Misra, J., \u201cAn example of stepwise refinement of distributed programs: quiescence detection,\u201d ACM Trans. Prog. Lang. Syst., Vol. 8, 3, July 1986, pp. 326\u2013343.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"8_CR3","unstructured":"Dijkstra, E.W., \u201cTwo starvation free solutions to a general exclusion problem,\u201d EWD 625."},{"key":"8_CR4","unstructured":"Ginat, D., \u201cDecentralized ordering of contending processes in a distributed system,\u201d PhD Thesis, Computer Science Dept., Univ. of Maryland, in preparation."},{"issue":"7","key":"8_CR5","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L., \u201cTime, clocks, and the ordering of events in a distributed system,\u201d Commun. ACM, Vol. 21, 7, July 1978, pp. 558\u2013564.","journal-title":"Commun. ACM"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., \u201cFast allocation of nearby resources in a distributed system,\u201d Proc. of the 12th ACM Symp. on Theory of Computing, 1980, pp. 70\u201381.","DOI":"10.1145\/800141.804654"},{"issue":"1","key":"8_CR7","first-page":"178","volume":"10","author":"S.L. Murphy","year":"1988","unstructured":"Murphy, S.L. and Shankar, A.U., \u201cA note on the drinking philosophers,\u201d ACM Trans. on Prog. Lang. and Syst., Vol. 10, No. 1, pp. 178\u2013188, January 1988.","journal-title":"ACM Trans. on Prog. Lang. and Syst."},{"issue":"1","key":"8_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"Ricart, G., and Agrawala, A.K., \u201cAn optimal algorithm for mutual exclusion in computer networks,\u201d Commun. ACM, Vol. 24, 1, Jan. 1981, pp. 9\u201317.","journal-title":"Commun. ACM"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Shankar, A.U., and Lam, S.S., \u201cTime-dependent distributed systems: proving safety, liveness and real-time properties,\u201d Distributed Computing, Vol. 2, No. 2, Springer-Verlag, 1987.","DOI":"10.1007\/BF01667079"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Styer, E. and Peterson G.L., \u201cImproved algorithms for distributed resource allocation,\u201d Proceedings of The Seventh Annual ACM Symposium on Principles of Distributed Computing, August 1988, pp. 105\u2013116.","DOI":"10.1145\/62546.62567"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51687-5_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:22:29Z","timestamp":1605630149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51687-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516873","9783540467502"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51687-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}